Two new optimal ternary two-weight codes and strongly regular graphs

DOI10.1016/0012-365X(94)00264-JzbMath0844.05101MaRDI QIDQ1910570

T. Aaron Gulliver

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

strongly regular graphstwo-weight codesquasi-cyclic codescyclic codescyclic shiftoptimal codescodeword

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Cyclic codes (94B15)

Related Items (9)

Two-weight and three-weight linear codes constructed from Weil sums ⋮ A new two-weight code and strongly regular graph ⋮ A new family of partial difference sets in 3-groups ⋮ The nonexistence of ternary [97, 6, 63 codes] ⋮ Cyclotomy over products of finite fields and combinatorial applications ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ An Enumeration of Certain Projective Ternary Two-Weight Codes ⋮ New strongly regular decompositions of the complete graphs with prime power vertices ⋮ Direct constructions of additive codes

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Local search in coding theory
• Optimal ternary quasi-cyclic codes
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• The trace description of irreducible quasi-cyclic codes
• The Geometry of Two-Weight Codes
• Nine good rate (m-1)/pm quasi-cyclic codes
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
• Twelve good rate (m-r)/pm quasi-cyclic codes
• Algebraically punctured cyclic codes

This page was built for publication: Two new optimal ternary two-weight codes and strongly regular graphs