Abstract | ||
---|---|---|
Two four-error-correcting binary codes of length 21 and 22 and of cardinality 64 and 80, respectively, are constructed. The codes consist of a union of cosets of linear codes with dimension 3 and were found by a maximum clique algorithm. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/s10623-004-1723-3 | Des. Codes Cryptography |
Keywords | Field | DocType |
linear code,error correction,error correction code | Discrete mathematics,BCJR algorithm,Concatenated error correction code,Combinatorics,Low-density parity-check code,Block code,Turbo code,Expander code,Reed–Muller code,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 3 | 0925-1022 |
Citations | PageRank | References |
5 | 0.73 | 7 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Patric R. J. Östergård | 1 | 609 | 70.61 |