Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
This paper studies senary simplex codes of type α and two punctured versions of these codes (type β and γ). Self-orthogonality, torsion codes, weight distribution and weight hie...
Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
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...