On the maximality of linear codes

DOI10.1007/S10623-009-9293-ZMaRDI QIDQ1035807zbMATHOpenAlexFDO

Authors András Gács, Tim L. Alderson

Publication date 4 November 2009

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

Full work available at URL https://doi.org/10.1007/s10623-009-9293-z

Mathematics Subject Classification ID

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

Recommendations

• Coprimitive sets and inextendable codes
• Maximal AMDS codes
• Maximum distance separable codes and arcs in projective spaces
• An extension theorem for arcs and linear codes
• scientific article; zbMATH DE number 2154148

Cites work

• scientific article; zbMATH DE number 2132175 (Why is no real title available?)
• scientific article; zbMATH DE number 3849977 (Why is no real title available?)
• scientific article; zbMATH DE number 4081719 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1795248 (Why is no real title available?)
• scientific article; zbMATH DE number 2109875 (Why is no real title available?)
• scientific article; zbMATH DE number 3281364 (Why is no real title available?)
• A Note on Elliptic Curves Over Finite Fields
• Abelian varieties over finite fields
• Arcs in PG(n,q), MDS-codes and three fundamental problems of B. Segre - some extensions
• Bounds on \((n,r)\)-arcs and their application to linear codes
• Codes from cubic curves and their extensions
• Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
• Coprimitive sets and inextendable codes
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Finite geometries, varieties and codes
• Intersection of arcs and normal rational curves in spaces of even characteristic
• Introduction to Coding Theory
• Linear point sets and Rédei type \(k\)-blocking sets in \(\mathrm{PG}(n,q)\)
• Maximal AMDS codes
• Maximum distance separable codes and arcs in projective spaces
• New examples of complete k-arcs in PG(2,q)
• On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
• On the graph of a function in many variables over a finite field
• On the number of slopes of the graph of a function defined on a finite field
• Small arcs in projective spaces
• Small complete arcs in Galois planes
• Small complete arcs in \(PG(2,p)\)
• Small complete arcs in 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

(14)

• Maximal AMDS codes
• Extension theorems for linear codes over finite fields
• Maximum intersection of linear codes and codes equivalent to linear
• On linear rigidity of a class of codes
• Linear codes from Denniston maximal arcs
• Forcing linearity on greedy codes
• Maximal solid codes
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• A Bound for the Maximum Weight of a Linear Code
• Further results on the classification of MDS codes
• Codes from cubic curves and their extensions
• On linear codes which attain the Solomon-Stiffler bound
• Maximum distance separable codes and arcs in projective spaces
• Long binary linear codes and large caps in projective space

Describes a project that uses

Uses Software

• AMDS

This page was built for publication: On the maximality of linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035807)