The following pages link to On near-MDS codes (Q1904252):
Displaying 43 items.
- Complete \((k,3)\)-arcs from quartic curves (Q281309) (← links)
- MacWilliams extension theorem for MDS codes over a vector space alphabet (Q510449) (← links)
- On the completeness of plane cubic curves over finite fields (Q522201) (← links)
- Maximal (\(n\),3)-arcs in PG(2,13) (Q557087) (← links)
- Almost MDS codes (Q679427) (← links)
- A Riemann hypothesis analogue for near-MDS codes (Q714035) (← links)
- Near-MDS codes from elliptic curves (Q831179) (← links)
- Elliptic near-MDS codes over \(\mathbb{F}_5\) (Q1008975) (← links)
- The packing problem in statistics, coding theory and finite projective spaces (Q1299059) (← links)
- Euclidean and Hermitian self-dual MDS codes over large finite fields. (Q1427010) (← links)
- Higher weights and near-MDR codes over chain rings (Q1620974) (← links)
- Duursma's reduced polynomial (Q1691234) (← links)
- NNMDS codes (Q1936585) (← links)
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes (Q1981800) (← links)
- Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes (Q2025375) (← links)
- A class of twisted generalized Reed-Solomon codes (Q2153755) (← links)
- MDS and near-MDS codes via twisted Reed-Solomon codes (Q2161429) (← links)
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\) (Q2249649) (← links)
- Construction of self-dual codes over finite rings \(\mathbb Z_{p^m}\) (Q2426422) (← links)
- Maximal AMDS codes (Q2426953) (← links)
- Quasi-cyclic NMDS codes (Q2447796) (← links)
- On the completeness of certain \(n\)-tracks arising from elliptic curves (Q2467330) (← links)
- The smallest size of a complete cap in PG(3,\,7) (Q2497464) (← links)
- Near-MDS codes arising from algebraic curves (Q2569922) (← links)
- Matrix characterization of linear codes with arbitrary Hamming weight hierarchy (Q2576228) (← links)
- Near MDS codes from oval polynomials (Q2659189) (← links)
- A formula on the weight distribution of linear codes with applications to AMDS codes (Q2667076) (← links)
- A class of almost MDS codes (Q2668084) (← links)
- The minimum locality of linear codes (Q2678979) (← links)
- On near-MDS codes and caps (Q2692969) (← links)
- Constructions of near MDS codes which are optimal locally recoverable codes (Q2701054) (← links)
- On<i>m</i>-MDS codes over finite fields (Q2921896) (← links)
- Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств (Q3381861) (← links)
- A survey on proper codes (Q5900373) (← links)
- On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) (Q6080544) (← links)
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes (Q6098081) (← links)
- New classes of NMDS codes with dimension 3 (Q6123055) (← links)
- The properties and the error-correcting pair for lengthened GRS codes (Q6146598) (← links)
- A class of double-twisted generalized Reed-Solomon codes (Q6150626) (← links)
- MDS or NMDS LCD codes from twisted Reed-Solomon codes (Q6159439) (← links)
- Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes (Q6159449) (← links)
- The \((+)\)-extended twisted generalized Reed-Solomon code (Q6184526) (← links)
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\) (Q6185648) (← links)
