On near-MDS codes

DOI10.1007/BF01222850zbMATH Open0849.94023OpenAlexW1530125006MaRDI QIDQ1904252FDOQ1904252

I. Landjev, Stefan Dodunekov

Publication date: 19 December 1995

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01222850

zbMATH Keywords

linear codescombinatorial designsnear-MDS codesarcs in finite projective planesmaximum-distance-separable codes

Mathematics Subject Classification ID

Other designs, configurations (05B30) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other finite incidence structures (geometric aspects) (51E30)

Cites Work

• The Geometry of Two-Weight Codes
• New 5-designs
• A Bound for Error-Correcting Codes
• Generalized Hamming weights for linear codes
• Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
• A comment on the weight structure of generator matrices of linear codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (58)

• The \([1, 0]\)-twisted generalized Reed-Solomon code
• Further results on covering codes with radius \(R\) and codimension \(tR+1\)
• Optimal ternary locally repairable codes
• Four new families of NMDS codes with dimension 4 and their applications
• Explicit constructions of NMDS self-dual codes
• The error-correcting pair for direct sum codes
• Infinite families of 3-designs from special symmetric polynomials
• On the construction of near-MDS matrices
• Title not available (Why is that?)
• Constructions of near MDS codes which are optimal locally recoverable codes
• Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
• Elliptic near-MDS codes over \(\mathbb{F}_5\)
• The minimum locality of linear codes
• Quasi-cyclic NMDS codes
• The properties and the error-correcting pair for lengthened GRS codes
• A class of double-twisted generalized Reed-Solomon codes
• Approximation of the Two-Part MDL Code
• A formula on the weight distribution of linear codes with applications to AMDS codes
• Maximal (\(n\),3)-arcs in PG(2,13)
• Complete \((k,3)\)-arcs from quartic curves
• A Riemann hypothesis analogue for near-MDS codes
• Near-MDS codes from elliptic curves
• The packing problem in statistics, coding theory and finite projective spaces
• Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
• MDS and near-MDS codes via twisted Reed-Solomon codes
• Near MDS codes with dimension 4 and their application in locally recoverable codes
• Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
• The \((+)\)-extended twisted generalized Reed-Solomon code
• Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
• Almost MDS codes
• Higher weights and near-MDR codes over chain rings
• A class of twisted generalized Reed-Solomon codes
• Near MDS codes from oval polynomials
• Near-MDS codes over some small fields
• NNMDS codes
• A class of almost MDS codes
• Euclidean and Hermitian self-dual MDS codes over large finite fields.
• Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\)
• The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
• Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes
• MDS or NMDS LCD codes from twisted Reed-Solomon codes
• Codes Between MBR and MSR Points With Exact Repair Property
• Irregular MDS Array Codes
• Near-MDS codes arising from algebraic curves
• Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств
• On the completeness of certain \(n\)-tracks arising from elliptic curves
• On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• The smallest size of a complete cap in PG(3,\,7)
• Duursma's reduced polynomial
• Title not available (Why is that?)
• On near-MDS codes and caps
• MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
• MacWilliams extension theorem for MDS codes over a vector space alphabet
• A survey on proper codes
• Onm-MDS codes over finite fields
• New classes of NMDS codes with dimension 3
• Maximal AMDS codes
• On the completeness of plane cubic curves over finite fields

This page was built for publication: On near-MDS codes

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