8 search results - page 1 / 2 » An Enumeration of Binary Self-Dual Codes of Length 32 |
DCC
2002
IEEE
14 years 4 months ago
2002
IEEE
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...