Constructions and families of covering codes and saturated sets of points in projective geometry
From MaRDI portal
Publication:4880341
DOI10.1109/18.476339zbMath0845.94022MaRDI QIDQ4880341
Publication date: 15 September 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.476339
94B05: Linear codes (general theory)
05B25: Combinatorial aspects of finite geometries
94B25: Combinatorial codes
94B75: Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory
05B40: Combinatorial aspects of packing and covering
Related Items
Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\), Further results on multiple coverings of the farthest-off points, On the resilience of Even-Mansour to invariant permutations, Galois geometries and coding theory, Ternary covering codes derived from BCH codes, On saturating sets in projective spaces., New quaternary linear codes with covering radius 2, On saturating sets in small projective geometries, Multiple coverings of the farthest-off points with small density from projective geometry, Constructing saturating sets in projective spaces using subgeometries, Linear codes with covering radius 3, New covering codes of radius \(R\), codimension \(tr\) and \(tr+\frac{R}{2}\), and saturating sets in projective spaces, On the minimum size of complete arcs and minimal saturating sets in projective planes
