Coprimitive sets and inextendable codes
From MaRDI portal
Recommendations
- Codes and projective multisets
- On cyclotomic cosets and code constructions
- Covering codes and extremal problems from invariant sets under permutations
- On a class of infinitary codes
- Codes and invariant theory
- Linearized decomposition codes and finite integer set coverings
- Some decompositions of Bernoulli sets and codes
- scientific article; zbMATH DE number 4127218
- Indecomposability of cyclic codes
- Locally complete sets and finite decomposable codes
Cites work
- scientific article; zbMATH DE number 3121305 (Why is no real title available?)
- A Bound for Error-Correcting Codes
- A Metrization for Power-Sets with Applications to Combinatorial Analysis
- A Theorem on Permutations of a Finite Field
- Algebraically punctured cyclic codes
- 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
- On (\(k,p^{e}\))-arcs in Desarguesian planes
- On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\)
- On the number of slopes of the graph of a function defined on a finite field
- Optimal ternary linear codes
- Some maximal arcs in finite projective planes
- The number of directions determined by a function over a finite field.
- The number of points on a curve, and applications. Arcs and curves: the legacy of Beniamino Segre
Cited in
(7)
This page was built for publication: Coprimitive sets and inextendable codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008999)