On the public citation graph

Almost MDS Codes

0 signed · 150 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-011-3810-9openalex-snapshot
Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1016/s0019-9958(72)90387-7openalex-snapshot
More about maximal (n, r)-sets
inferredcites →https://doi.org/10.1016/s0097-3165(75)80012-4openalex-snapshot
Some results concerning {(q+1)(n−1);n}-arcs and {(q+1)(n−1)+1;n}-arcs in finite projective planes of order q
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.32157openalex-snapshot
Construction and decoding of a class of algebraic geometry codes
inferredcites →https://doi.org/10.1109/tit.1964.1053661openalex-snapshot
Maximum distanceq-nary codes
inferredcites →https://doi.org/10.1112/blms/13.2.179openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
inferredcites →https://doi.org/10.1112/blms/25.2.199openalex-snapshot
General Galois Geometries
inferredcites →https://doi.org/10.1214/aoms/1177729331openalex-snapshot
Orthogonal Arrays of Strength two and three
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcd.21783openalex-snapshot
Evasive subspaces
inferred← citeshttps://doi.org/10.1007/1-4020-7987-7_5openalex-snapshot
Simple and Efficient Systematic a-Codes from Error Correcting Codes
inferred← citeshttps://doi.org/10.1007/978-1-4613-0283-4_13openalex-snapshot
The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001
inferred← citeshttps://doi.org/10.1007/978-1-4615-5121-8_6openalex-snapshot
Curves, Codes and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-72284-5_13openalex-snapshot
The Mathematical Aspects of Some Problems from Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_8openalex-snapshot
Near MDS Codes with Dimension 4 and Their Application in Locally Recoverable Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_12openalex-snapshot
Quadratic Residue Codes over $$\mathbb {F}_p+v\mathbb {F}_p+v^{2}\mathbb {F}_p$$
inferred← citeshttps://doi.org/10.1007/978-3-319-71045-7_6openalex-snapshot
Improvement on Minimum Distance of Symbol-Pair Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_19openalex-snapshot
Quasi-Cyclic Codes over $\mathbb{F}_{13}$
inferred← citeshttps://doi.org/10.1007/978-981-15-8061-1_15openalex-snapshot
Linear Secret Sharing Schemes with Finer Access Structure
inferred← citeshttps://doi.org/10.1007/b116807openalex-snapshot
Progress on cryptography : 25 years of cryptography in China
inferred← citeshttps://doi.org/10.1007/s00013-026-02270-xopenalex-snapshot
Subsets of $${\mathbb {P}}^4$$ with no four points on a plane
inferred← citeshttps://doi.org/10.1007/s00200-003-0141-5openalex-snapshot
On the Extendibility of Near-MDS Elliptic Codes
inferred← citeshttps://doi.org/10.1007/s00200-008-0058-0openalex-snapshot
Maximal AMDS codes
inferred← citeshttps://doi.org/10.1007/s00200-025-00694-6openalex-snapshot
Amds codes and quantum AMDS codes of length $$3p^s$$ over $${\mathbb {F}}_{p^m}$$
inferred← citeshttps://doi.org/10.1007/s00373-004-0592-xopenalex-snapshot
3-Wise Exactly 1-Intersecting Families of Sets
inferred← citeshttps://doi.org/10.1007/s10623-007-9144-8openalex-snapshot
Elliptic near-MDS codes over $${\mathbb{F}}_5$$
inferred← citeshttps://doi.org/10.1007/s10623-016-0222-7openalex-snapshot
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
inferred← citeshttps://doi.org/10.1007/s10623-016-0316-2openalex-snapshot
Covering arrays from m-sequences and character sums
inferred← citeshttps://doi.org/10.1007/s10623-019-00619-8openalex-snapshot
Theory of supports for linear codes endowed with the sum-rank metric
inferred← citeshttps://doi.org/10.1007/s10623-021-00847-xopenalex-snapshot
New families of self-dual codes
inferred← citeshttps://doi.org/10.1007/s10623-021-00968-3openalex-snapshot
An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23)
inferred← citeshttps://doi.org/10.1007/s10623-022-01099-zopenalex-snapshot
The minimum locality of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01186-9openalex-snapshot
$$(d,\varvec{\sigma })$$-Veronese variety and some applications
inferred← citeshttps://doi.org/10.1007/s10623-024-01402-0openalex-snapshot
Further results on covering codes with radius R and codimension $$tR+1$$
inferred← citeshttps://doi.org/10.1007/s10623-024-01409-7openalex-snapshot
Optimal ternary locally repairable codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01460-4openalex-snapshot
New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01508-5openalex-snapshot
Infinite families of 3-designs from special symmetric polynomials
inferred← citeshttps://doi.org/10.1007/s10623-026-01924-9openalex-snapshot
Generalized hamming weights of almost-MDS codes with respect to twisted Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s11128-019-2197-6openalex-snapshot
Constructions of new entanglement-assisted quantum MDS and almost MDS codes
inferred← citeshttps://doi.org/10.1007/s11424-012-0041-5openalex-snapshot
NNMDS codes
inferred← citeshttps://doi.org/10.1007/s11786-012-0117-6openalex-snapshot
Relations Between Möbius and Coboundary Polynomials
inferred← citeshttps://doi.org/10.1007/s11859-014-0982-8openalex-snapshot
Near-MDR codes over Z 4
inferred← citeshttps://doi.org/10.1007/s12095-017-0223-zopenalex-snapshot
Quadratic residue codes over the ring 𝔽 p [ u ] / 〈 u m − u 〉 $\mathbb {F}_{p}[u]/\langle u^{m}-u\rangle $ and their Gray images
inferred← citeshttps://doi.org/10.1007/s12095-024-00753-8openalex-snapshot
A family of linear codes with few weights and their subfield codes
inferred← citeshttps://doi.org/10.1007/s12190-024-02127-yopenalex-snapshot
Two new classes of AMDS symbol-pair cyclic codes of length 4p
inferred← citeshttps://doi.org/10.1016/j.dam.2005.06.014openalex-snapshot
A survey on proper codes
inferred← citeshttps://doi.org/10.1016/j.disc.2005.06.039openalex-snapshot
The smallest size of a complete cap in PG(3,7)
inferred← citeshttps://doi.org/10.1016/j.disc.2018.06.034openalex-snapshot
On q -Steiner systems from rank metric codes
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112277openalex-snapshot
Near MDS codes from oval polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113593openalex-snapshot
On Hamming distance distributions of repeated-root constacyclic codes of length 3p over Fpm+uFpm
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113835openalex-snapshot
On regular sets of affine type in finite Desarguesian planes and related codes
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114080openalex-snapshot
The extended codes of projective two-weight codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.09.007openalex-snapshot
On the completeness of certain n-tracks arising from elliptic curves
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.05.008openalex-snapshot
Quasi-cyclic NMDS codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.05.003openalex-snapshot
On dually almost MRD codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101933openalex-snapshot
A formula on the weight distribution of linear codes with applications to AMDS codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2023.102184openalex-snapshot
Constructions of near MDS codes which are optimal locally recoverable codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102401openalex-snapshot
The extended codes of some linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102495openalex-snapshot
Four new families of NMDS codes with dimension 4 and their applications
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102616openalex-snapshot
Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102659openalex-snapshot
Two families of self-orthogonal codes with applications in LCD codes and optimally extendable codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102721openalex-snapshot
The dual codes of two families of BCH codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102844openalex-snapshot
The extended codes of NMDS codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102931openalex-snapshot
Structural transformations in binary matroids: Augmenting linear codes via splitting operations
inferred← citeshttps://doi.org/10.1016/j.jcta.2003.10.003openalex-snapshot
Euclidean and Hermitian self-dual MDS codes over large finite fields
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.07.001openalex-snapshot
Construction of self-dual codes over finite rings Zpm
inferred← citeshttps://doi.org/10.1016/j.jcta.2024.105908openalex-snapshot
Maximum flag-rank distance codes
inferred← citeshttps://doi.org/10.1016/j.jda.2012.04.006openalex-snapshot
Quasi-cyclic codes over F13 and enumeration of defining polynomials
inferred← citeshttps://doi.org/10.1016/j.laa.2005.07.008openalex-snapshot
Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00520-4openalex-snapshot
On self-dual codes over some prime fields
inferred← citeshttps://doi.org/10.1016/s0378-3758(00)00306-2openalex-snapshot
The geometric description of a cyclic -arc in , q square
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00043-3openalex-snapshot
The packing problem in statistics, coding theory and finite projective spaces
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1023/a:1008247720662openalex-snapshot
Codes of Small Defect
inferred← citeshttps://doi.org/10.1023/a:1011264906914openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1024763410967openalex-snapshot
Some New Results on Optimal Codes Over F5
inferred← citeshttps://doi.org/10.1023/a:1026162531539openalex-snapshot
Extended Binomial Moments of a Linear Code and the Undetected Error Probability
inferred← citeshttps://doi.org/10.1063/5.0120529openalex-snapshot
Special NMDS codes of dimension three over the finite field of order 27
inferred← citeshttps://doi.org/10.1080/09720529.2007.10698119openalex-snapshot
Self-dual codes over some prime fields constructed from skew-Hadamard matrices
inferred← citeshttps://doi.org/10.1088/2058-9565/ad332bopenalex-snapshot
Near MDS and near quantum MDS codes via orthogonal arrays
inferred← citeshttps://doi.org/10.1109/18.556618openalex-snapshot
A characterization of codes with extreme parameters
inferred← citeshttps://doi.org/10.1109/18.720550openalex-snapshot
Algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/18.825840openalex-snapshot
On a sequence of cyclic codes with minimum distance six
inferred← citeshttps://doi.org/10.1109/18.992802openalex-snapshot
NMDS codes of maximal length over F/sub q/,8≤q≤11
inferred← citeshttps://doi.org/10.1109/access.2021.3099434openalex-snapshot
Self-Dual Codes, Symmetric Matrices, and Eigenvectors
inferred← citeshttps://doi.org/10.1109/access.2025.3590462openalex-snapshot
A Family of Almost MDS Symbol-Pair Codes of Length 8p
inferred← citeshttps://doi.org/10.1109/access.2025.3595428openalex-snapshot
Quantum AMDS Negacyclic Codes of Length 2 p s Over F p m
inferred← citeshttps://doi.org/10.1109/access.2025.3638664openalex-snapshot
A Matrix-Theoretic Approach to the Construction of Reversible DNA Codes Over F ₄² t
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383337openalex-snapshot
New QC Codes over GF(11)
inferred← citeshttps://doi.org/10.1109/acdsa59508.2024.10467553openalex-snapshot
Classification of a Class of A2MDS codes and Application in Cryptography Algorithms
inferred← citeshttps://doi.org/10.1109/isit.2007.4557599openalex-snapshot
Reliable Memories with Subline Accesses
inferred← citeshttps://doi.org/10.1109/isit.2010.5513736openalex-snapshot
Near MDS poset codes and distributions
inferred← citeshttps://doi.org/10.1109/isit.2014.6875415openalex-snapshot
Families of Optimal Binary Non-MDS Erasure Codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006482openalex-snapshot
Generalized column distances for convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2018.8437466openalex-snapshot
On the Maximal Code Length of Optimal Linear Locally Repairable Codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/ita.2014.6804237openalex-snapshot
Generalized weights and bounds for error probability over erasure channels
inferred← citeshttps://doi.org/10.1109/locs.2019.2911517openalex-snapshot
Five Times Extended Reed-Solomon Codes Applicable in Memory Storage Systems
inferred← citeshttps://doi.org/10.1109/tcomm.2025.3608328openalex-snapshot
A Family of Linear Codes That Are Either Non-GRS MDS Codes or NMDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928297openalex-snapshot
New MDS or Near-MDS Self-Dual Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2481889openalex-snapshot
A Construction of New MDS Symbol-Pair Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2956144openalex-snapshot
Maximizing Multivariate Information With Error-Correcting Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2957354openalex-snapshot
New Lower Bounds for Permutation Codes Using Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2966439openalex-snapshot
Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application
inferred← citeshttps://doi.org/10.1109/tit.2020.2990396openalex-snapshot
Infinite Families of Near MDS Codes Holding t -Designs
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
inferred← citeshttps://doi.org/10.1109/tit.2020.3021707openalex-snapshot
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
inferred← citeshttps://doi.org/10.1109/tit.2021.3052749openalex-snapshot
Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances
inferred← citeshttps://doi.org/10.1109/tit.2022.3152580openalex-snapshot
On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs
inferred← citeshttps://doi.org/10.1109/tit.2022.3157199openalex-snapshot
Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3190676openalex-snapshot
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3194914openalex-snapshot
Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q 2
inferred← citeshttps://doi.org/10.1109/tit.2023.3314059openalex-snapshot
On Twisted Generalized Reed-Solomon Codes With ℓ Twists
inferred← citeshttps://doi.org/10.1109/tit.2023.3342216openalex-snapshot
The Extended Codes of a Family of Reversible MDS Cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3346179openalex-snapshot
Generalized Singleton Type Upper Bounds
inferred← citeshttps://doi.org/10.1109/tit.2024.3402745openalex-snapshot
On ℓ-MDS Codes and a Conjecture on Infinite Families of 1-MDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3449899openalex-snapshot
A New Upper Bound for Linear Codes and Vanishing Partial Weight Distributions
inferred← citeshttps://doi.org/10.1109/tit.2025.3535700openalex-snapshot
The Sufficient and Necessary Conditions for the Minimum Distance of the BCH Code C (q,q+1,3,h) to Be 3 and 4
inferred← citeshttps://doi.org/10.1109/tit.2025.3579249openalex-snapshot
Bounds on MLDR Codes Over 𝕫 pt
inferred← citeshttps://doi.org/10.1109/tit.2025.3610149openalex-snapshot
On (ℒ, 𝒫)-Twisted Generalized Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3645262openalex-snapshot
Constructions of l -MDS Self-Dual Codes With Flexible l via Deleted Generalized Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3681279openalex-snapshot
A Generic Construction of q -ary Near-MDS Codes Supporting 2-Designs With Lengths Beyond q + 1
inferred← citeshttps://doi.org/10.1109/tit.2026.3697733openalex-snapshot
The Parameters of Three Classes of Extended BCH Codes
inferred← citeshttps://doi.org/10.1109/tit.2026.3712061openalex-snapshot
The True Minimum Distance of the Antiprimitive BCH Codes With Designed Distance 3
inferred← citeshttps://doi.org/10.1142/9789814335768_0006openalex-snapshot
Codes, Arrangements and Matroids
inferred← citeshttps://doi.org/10.1142/s0129183126430023openalex-snapshot
Entanglement-assisted quantum error-correcting codes and asymmetric entanglement-assisted quantum error-correcting codes of length 5pt over 𝔽pm
inferred← citeshttps://doi.org/10.1142/s1793830923500842openalex-snapshot
Classification of a class of A3MDS code and applications in secret-sharing schemes
inferred← citeshttps://doi.org/10.1145/3358528.3358581openalex-snapshot
Improved Constructions for Optimal Multi-erasure Locally Recoverable Codes for Big Data Storage
inferred← citeshttps://doi.org/10.12988/ams.2013.13259openalex-snapshot
A note on new (near-) MDS Euclidean self-dual codes
inferred← citeshttps://doi.org/10.13140/rg.2.2.11927.32164openalex-snapshot
Generalized of Optimal Codes
inferred← citeshttps://doi.org/10.1360/ssm-2022-0041openalex-snapshot
A classification for optimal quaternary locally repairable codes
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1107openalex-snapshot
Construction of Singleton-Type Optimal LRCs from Existing LRCs and Near-MDS Codes
inferred← citeshttps://doi.org/10.2298/fil2433889dopenalex-snapshot
AMDS constacyclic codes and quantum AMDS codes
inferred← citeshttps://doi.org/10.23919/cje.2014.10851235openalex-snapshot
On l-th NMDS Codes∗
inferred← citeshttps://doi.org/10.3390/math14173150openalex-snapshot
Codes over Frobenius Ring T
inferred← citeshttps://doi.org/10.3934/amc.2022015openalex-snapshot
On the polycyclic codes over $ \mathbb{F}_q+u\mathbb{F}_q $
inferred← citeshttps://doi.org/10.3934/amc.2022083openalex-snapshot
Improved lower bounds for self-dual codes over $ \mathbb{F}_{11} $, $ \mathbb{F}_{13} $, $ \mathbb{F}_{17} $, $ \mathbb{F}_{19} $ and $ \mathbb{F}_{23} $
inferred← citeshttps://doi.org/10.3934/amc.2023037openalex-snapshot
The weight distributions of several classes of few-weight linear codes
inferred← citeshttps://doi.org/10.3934/amc.2024017openalex-snapshot
New self-dual codes from TGRS codes with general $ \ell $ twists
inferred← citeshttps://doi.org/10.3934/amc.2025031openalex-snapshot
An infinite family of AMDS codes holding 2-designs
inferred← citeshttps://doi.org/10.3934/amc.2025042openalex-snapshot
Some sufficient conditions for $ (\mathcal{A*B})^\perp $ with an error-correcting pair $ (\mathcal{A},\mathcal{B}) $
inferred← citeshttps://doi.org/10.3934/amc.2025050openalex-snapshot
New infinite families of uniformly packed near-MDS codes and multiple coverings, based on the ternary Golay code
inferred← citeshttps://doi.org/10.3934/amc.2026046openalex-snapshot
Almost MDS, almost Griesmer quasi-perfect codes with Griesmer dual codes
inferred← citeshttps://doi.org/10.3934/math.20251292openalex-snapshot
On the construction of reversible DNA codes over $ F_{4^{2m}} $ via $ T^n $-set codes
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07267openalex-snapshot
Long Optimal or Small-Defect LRC Codes with Unbounded Minimum Distances
inferred← citeshttps://doi.org/10.48550/arxiv.2009.06609openalex-snapshot
Self-dual codes over $GF(q)$ with symmetric generator matrices
inferred← citeshttps://doi.org/10.48550/arxiv.2102.00597openalex-snapshot
The minimum linear locality of linear codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0211107openalex-snapshot
On Near-MDS Elliptic Codes
inferred← citeshttps://doi.org/10.5614/j.math.fund.sci.2014.46.1.6openalex-snapshot
New Hermitian Self-Dual MDS or Near-MDS Codes over Finite Fields
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.