Coprimitive sets and inextendable codes

DOI10.1007/s10623-007-9079-0zbMath1178.94241OpenAlexW1977254982MaRDI QIDQ1008999

Tim L. Alderson, Aiden A. Bruen

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9079-0

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

Maximum weight spectrum codes ⋮ On the maximality of linear codes

Cites Work

• Unnamed Item
• Unnamed Item
• On (\(k,p^{e}\))-arcs in Desarguesian planes
• On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\)
• Optimal ternary linear codes
• On the number of slopes of the graph of a function defined on a finite field
• The number of directions determined by a function over a finite field.
• Bounds on \((n,r)\)-arcs and their application to linear codes
• Finite nets. II: Uniqueness and imbedding
• Maximum distance separable codes and arcs in projective spaces
• A Metrization for Power-Sets with Applications to Combinatorial Analysis
• Algebraically punctured cyclic codes
• Some maximal arcs in finite projective planes
• A Bound for Error-Correcting Codes
• A Theorem on Permutations of a Finite Field

This page was built for publication: Coprimitive sets and inextendable codes