Name
Abstract | ||
|---|---|---|
We present a method for maximum likelihood decoding of the (48,24,12) quadratic residue code. This method is based on projecting the code onto a subcode with an acyclic Tanner graph, and representing the set of coset leaders by a trellis diagram. This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule. We show that unlike the (24,12,8) Golay code, the (48,24,12) code does not have a Pless-construction which has been an open question in the literature. It is determined that the highest minimum distance of a (48,24) binary code having a Pless (1986) construction is 10, and up to equivalence there are three such codes. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/TIT.2003.811930 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
coset leader,maximum likelihood,binary code,golay code,ml decoding,open question,highest minimum distance,acyclic tanner graph,wagner rule,quadratic residue code,level coset decoding,graph theory,block codes,reed muller codes,communication systems,viterbi algorithm,hexacode,binary codes,hamming codes,convolutional codes | Quadratic residue code,Discrete mathematics,Combinatorics,Constant-weight code,Systematic code,Polynomial code,Ternary Golay code,Cyclic code,Hamming bound,Binary Golay code,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 6 | 0018-9448 |
Citations | PageRank | References |
2 | 0.40 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Esmaeili | 1 | 2 | 0.40 |
| T. A. Gulliver | 2 | 355 | 48.59 |
| A. K. Khandani | 3 | 297 | 19.65 |