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 ...
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...
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...
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...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...