Coprimitive sets and inextendable codes
From MaRDI portal
Publication:1008999
DOI10.1007/s10623-007-9079-0zbMath1178.94241MaRDI 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
94B65: Bounds on codes
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
51E20: Combinatorial structures in finite projective spaces
Related Items
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