100
click to vote
DCC
2011
IEEE
14 years 6 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
74
Voted
TIT
2008
14 years 11 months ago
2008
We construct new MDS or near-MDS self-dual codes over large finite fields. In particular we show that there exists a Euclidean self-dual MDS code of length n = q over GF(q) wheneve...
DCC
2001
IEEE
15 years 10 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
2001
IEEE
15 years 10 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 ...