Maximal AMDS codes

DOI10.1007/S00200-008-0058-0MaRDI QIDQ2426953zbMATH OpenOpenAlexFDO

Authors Tim L. Alderson, Aiden A. Bruen

Publication date 14 May 2008

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00200-008-0058-0

zbMATH Keywords

NMDS codesCubic curvesCode extensionComplete arcs

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• On the maximality of linear codes
• Coprimitive sets and inextendable codes
• Almost MDS codes
• Some new results on optimal codes over \(\mathbb F_5\)
• Maximum distance separable codes and arcs in projective spaces

Cites work

• scientific article; zbMATH DE number 3121305 (Why is no real title available?)
• scientific article; zbMATH DE number 3855866 (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 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 2065945 (Why is no real title available?)
• scientific article; zbMATH DE number 3213269 (Why is no real title available?)
• scientific article; zbMATH DE number 3281364 (Why is no real title available?)
• scientific article; zbMATH DE number 3301159 (Why is no real title available?)
• A Metrization for Power-Sets with Applications to Combinatorial Analysis
• Abelian varieties over finite fields
• Almost MDS codes
• Bounds on \((n,r)\)-arcs and their application to linear codes
• Complete arcs
• Construction of \((n, r)\)-arcs in \(PG(2, q)\)
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Finite geometries, varieties and codes
• Maximal (\(n\),3)-arcs in PG(2,13)
• Maximal \((n,3)\)-arcs in PG(2,11)
• Maximum distance separable codes and arcs in projective spaces
• Multiple Blocking Sets and Arcs in Finite Planes
• Near-MDS codes over some small fields
• On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre
• On extendable planes, M.D.S. codes and hyperovals in PG(2,q), \(q=2^ t\)
• On near-MDS codes
• On small \(\{k;q\}\)-arcs in planes of order \(q^2\)
• On the extendibility of near-MDS elliptic 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.

Cited in

(4)

• Further results on covering codes with radius \(R\) and codimension \(tR+1\)
• Covering arrays from \(m\)-sequences and character sums
• On the maximality of linear codes
• The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)

Describes a project that uses

Uses Software

• AMDS

This page was built for publication: Maximal AMDS codes

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