On Senary Simplex Codes

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 hierarchy properties are studied. We give a new construction of senary codes via their binary and ternary counterparts, and show that type α and β simplex codes can be constructed by this method.

• Type: Conference
• Year: 2001
• Where: AAECC
• Authors: Manish K. Gupta, David G. Glynn, T. Aaron Gulliver
• Keywords: AAECC 2001, Algorithms, Senary Simplex Codes, Simplex Codes, Torsion Codes