Optimal linear codes over \(\mathrm{GF}(4)\)

DOI10.1016/0012-365X(94)90160-0zbMath0792.94005MaRDI QIDQ1322271

P. P. Greenough, Raymond Hill

Publication date: 15 August 1994

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

zbMATH Keywords

minimum distancequaternary codessmallest length

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (10)

New bounds for the minimum length of quaternary linear codes of dimension five ⋮ The geometric approach to the existence of some quaternary Griesmer codes ⋮ Quaternary Unequal Error Protection Codes ⋮ Maximal entanglement entanglement-assisted quantum codes constructed from linear codes ⋮ On the covering radius of Simplex codes ⋮ Unnamed Item ⋮ New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) ⋮ On the minimum length of quaternary linear codes of dimension five ⋮ Entanglement-assisted quantum codes from quaternary codes of dimension five ⋮ Optimal linear codes over \(\mathrm{GF}(4)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest length of binary 7-dimensional linear codes with prescribed minimum distance
• Optimal ternary linear codes
• On weights in quadratic-residue codes
• Optimal linear codes over \(\mathrm{GF}(4)\)
• The Geometry of Two-Weight Codes
• An updated table of minimum-distance bounds for binary linear codes
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
• Some results concerning linear codes and (k, 3)-caps in three-dimensional Galois space
• A note on k-3 caps in three-dimensional Galois space

This page was built for publication: Optimal linear codes over \(\mathrm{GF}(4)\)