Name
Abstract | ||
|---|---|---|
This correspondence revisits the idea of constructing a binary [mn,mk] code from an [n,k] code over F2m by concatenating the code with a suitable basis representation of F2m over F2. We construct two nonequivalent examples of doubly even self-dual binary codes of length 160 which turn out to be of minimum distance 24. This improves the lower bound for this class of codes, whereas the upper bound is given by 28. The construction at hand seems to be of interest beyond this particular example. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TIT.2004.839535 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
minimum distance,nonequivalent example,self-dual binary code,suitable basis representation,minimum weight,particular example,binary codes,concatenated codes,upper bound,block codes,lower bound | Discrete mathematics,Combinatorics,Concatenated error correction code,Automorphism,Upper and lower bounds,Block code,Binary code,Linear code,Minimum weight,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
51 | 1 | 0018-9448 |
Citations | PageRank | References |
3 | 0.53 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marten van Dijk | 1 | 46 | 6.75 |
| Sebastian Egner | 2 | 158 | 132.06 |
| M. Greferath | 3 | 81 | 7.88 |
| Alfred Wassermann | 4 | 125 | 23.33 |