On the public citation graph

On near-MDS codes

0 signed · 161 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-3-642-78659-4openalex-snapshot
Informations- und Codierungstheorie
inferredcites →https://doi.org/10.1007/978-3-642-97143-3openalex-snapshot
Informations- und Codierungstheorie
inferredcites →https://doi.org/10.1007/978-94-011-3810-9openalex-snapshot
Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1016/s0021-9800(69)80115-8openalex-snapshot
New 5-designs
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.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1112/blms/18.2.97openalex-snapshot
The Geometry of Two-Weight Codes
inferredcites →https://doi.org/10.1112/s0024609399346154openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
inferredcites →https://doi.org/10.1137/0117056openalex-snapshot
Combinatorial Configurations
inferredcites →https://doi.org/10.1137/1016056openalex-snapshot
Coding and Combinatorics
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting Codes

What points at this work

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

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-3-030-16458-4_12openalex-snapshot
Secret Sharing Using Near-MDS Codes
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-642-42033-7_3openalex-snapshot
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
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/s00022-004-1777-4openalex-snapshot
Classification of the (n, 3)-arcs in PG(2, 7)
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-013-9837-0openalex-snapshot
The non-existence of some NMDS codes and the extremal sizes of complete $$(n,3)$$ ( n , 3 ) -arcs in $$PG(2,16)$$ PG ( 2 , 16 )
inferred← citeshttps://doi.org/10.1007/s10623-015-0073-7openalex-snapshot
Complete $$(k,3)$$ ( k , 3 ) -arcs from quartic curves
inferred← citeshttps://doi.org/10.1007/s10623-016-0215-6openalex-snapshot
On the completeness of plane cubic curves over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-016-0247-yopenalex-snapshot
MacWilliams Extension Theorem for MDS codes over a vector space alphabet
inferred← citeshttps://doi.org/10.1007/s10623-021-00852-0openalex-snapshot
Near-MDS codes from elliptic curves
inferred← citeshttps://doi.org/10.1007/s10623-021-00910-7openalex-snapshot
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01049-9openalex-snapshot
MDS and near-MDS codes via twisted Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01099-zopenalex-snapshot
The minimum locality of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01141-0openalex-snapshot
On near–MDS codes and caps
inferred← citeshttps://doi.org/10.1007/s10623-023-01304-7openalex-snapshot
The properties and the error-correcting pair for lengthened GRS codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01313-6openalex-snapshot
New classes of NMDS codes with dimension 3
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-01508-5openalex-snapshot
Infinite families of 3-designs from special symmetric polynomials
inferred← citeshttps://doi.org/10.1007/s10623-025-01718-5openalex-snapshot
Linear codes in the folded Hamming distance and the quasi MDS property
inferred← citeshttps://doi.org/10.1007/s10801-025-01383-wopenalex-snapshot
On 4-general sets in finite projective spaces
inferred← citeshttps://doi.org/10.1007/s11424-012-0041-5openalex-snapshot
NNMDS codes
inferred← citeshttps://doi.org/10.1007/s11424-026-4541-0openalex-snapshot
Constructions of Several Classes of Almost Optimal NMDS and Optimal MDS Codes
inferred← citeshttps://doi.org/10.1007/s11859-014-0982-8openalex-snapshot
Near-MDR codes over Z 4
inferred← citeshttps://doi.org/10.1007/s12095-022-00564-9openalex-snapshot
MDS or NMDS LCD codes from twisted Reed-Solomon codes
inferred← citeshttps://doi.org/10.1007/s12095-022-00605-3openalex-snapshot
Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes
inferred← citeshttps://doi.org/10.1007/s12095-023-00667-xopenalex-snapshot
On the construction of near-MDS matrices
inferred← citeshttps://doi.org/10.1007/s12095-024-00704-3openalex-snapshot
The [1, 0]-twisted generalized Reed-Solomon code
inferred← citeshttps://doi.org/10.1016/j.dam.2005.06.014openalex-snapshot
A survey on proper codes
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.008openalex-snapshot
A Riemann hypothesis analogue for near-MDS codes
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.043openalex-snapshot
Maximal (n,3) -arcs in PG(2,13)
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.021openalex-snapshot
Near-MDS codes arising from algebraic curves
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.2020.112277openalex-snapshot
Near MDS codes from oval polynomials
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113490openalex-snapshot
Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
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.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.2022.101996openalex-snapshot
A class of almost MDS 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.2023.102338openalex-snapshot
Near-MDS codes from maximal arcs in PG(2,q)
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.102721openalex-snapshot
The dual codes of two families of BCH codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102779openalex-snapshot
Two classes of NMDS codes from Roth-Lempel 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.102900openalex-snapshot
Combinatorial t-designs from the second minimum weight codewords
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.laa.2005.07.008openalex-snapshot
Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
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.1023/a:1008247720662openalex-snapshot
Codes of Small Defect
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/00207160.2013.818669openalex-snapshot
Onm-MDS codes over finite fields
inferred← citeshttps://doi.org/10.1109/18.567708openalex-snapshot
Almost-MDS and near-MDS codes for error detection
inferred← citeshttps://doi.org/10.1109/18.705584openalex-snapshot
Minimal vectors in linear codes
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.2019.2934769openalex-snapshot
Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and $K-1$
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/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/cisat66811.2025.11181707openalex-snapshot
Two classes of NMDS codes with dimension 3 and 4
inferred← citeshttps://doi.org/10.1109/icc.2017.7997268openalex-snapshot
Binary index codes using l-th NMDS codes
inferred← citeshttps://doi.org/10.1109/icnidc.2009.5360821openalex-snapshot
A secret sharing scheme based on Near-MDS codes
inferred← citeshttps://doi.org/10.1109/isit.2001.935924openalex-snapshot
Matrix characterization of generalized Hamming weights
inferred← citeshttps://doi.org/10.1109/isit.2004.1365565openalex-snapshot
Matrix characterization of near-MDS codes over Z/sub m/ and abelian groups
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.2016.7541639openalex-snapshot
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
inferred← citeshttps://doi.org/10.1109/isit.2017.8006482openalex-snapshot
Generalized column distances for convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006512openalex-snapshot
On optimal ternary locally repairable 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/isit45174.2021.9518245openalex-snapshot
On Optimal Quaternary Locally Repairable Codes
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/tcomm.2018.2789457openalex-snapshot
Binary Informed Source Codes and Index Codes Using Certain Near-MDS Codes
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3155165openalex-snapshot
Constructions and Weight Distributions of Optimal Locally Repairable Codes
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.2002.805082openalex-snapshot
The MMD codes are proper for error detection
inferred← citeshttps://doi.org/10.1109/tit.2003.814491openalex-snapshot
The duals of mmd codes are proper for error detection
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.2018.2880913openalex-snapshot
Self-Dual Near MDS Codes from Elliptic Curves
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.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.2020.3032600openalex-snapshot
An Infinite Family of Linear Codes Supporting 4-Designs
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.3156072openalex-snapshot
Infinite Families of Linear Codes Supporting More t-Designs
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.3203380openalex-snapshot
Projective Linear Codes From Some Almost Difference Sets
inferred← citeshttps://doi.org/10.1109/tit.2023.3257320openalex-snapshot
On Deep Holes of Elliptic Curve Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3272384openalex-snapshot
Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type
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.3348146openalex-snapshot
Many Non-Reed-Solomon Type MDS Codes From Arbitrary Genus Algebraic Curves
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.3541799openalex-snapshot
Covering Radii and Deep Holes of Two Classes of Extended Twisted GRS Codes and Their Applications
inferred← citeshttps://doi.org/10.1109/tit.2025.3613570openalex-snapshot
Log-Concave Sequences in Coding Theory
inferred← citeshttps://doi.org/10.1109/tit.2025.3626824openalex-snapshot
Analysis of Roth–Lempel Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3627921openalex-snapshot
On the Equivalence of NMDS 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.2025.3649882openalex-snapshot
The t -Designs and the Subcode Support Weight Distributions of r -GMDS 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.3712030openalex-snapshot
New Explicit Constructions of MDS and NMDS Algebraic Geometry 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.1109/tit.2026.3718415openalex-snapshot
The Complete Weight Enumerators of Linear Codes From Generalized Augmented Codes
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.11575/cdm.v1i1.61901.g46639openalex-snapshot
Classification of linear codes exploiting an invariant
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.1360/ssm-2022-0041openalex-snapshot
A classification for optimal quaternary locally repairable codes
inferred← citeshttps://doi.org/10.1504/ijicot.2010.032133openalex-snapshot
Constructions of self-dual codes over finite commutative chain rings
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.2139/ssrn.5508194openalex-snapshot
Long QMDS additive code
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/math9050486openalex-snapshot
The Shape of the (15,3)-Arc of PG(2,7)
inferred← citeshttps://doi.org/10.3934/amc.2017048openalex-snapshot
Duursma's reduced polynomial
inferred← citeshttps://doi.org/10.3934/amc.2018045openalex-snapshot
Higher weights and near-MDR codes over chain rings
inferred← citeshttps://doi.org/10.3934/amc.2020072openalex-snapshot
Some optimal cyclic $ \mathbb{F}_q $-linear $ \mathbb{F}_{q^t} $-codes
inferred← citeshttps://doi.org/10.3934/amc.2023046openalex-snapshot
The error-correcting pair for direct sum codes
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.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.2026040openalex-snapshot
Constructions of several classes of MDS and NMDS codes with dimension 3
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04602openalex-snapshot
New MDS or near MDS self-dual codes over finite fields
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05730openalex-snapshot
On Optimal Ternary Locally Repairable 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.2102.00597openalex-snapshot
The minimum linear locality of linear codes
inferred← citeshttps://doi.org/10.48550/arxiv.2111.11901openalex-snapshot
Self-dual twisted generalized Reed-Solomon codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0211107openalex-snapshot
On Near-MDS Elliptic Codes
inferred← citeshttps://doi.org/10.55630/sjc.2012.6.253-266openalex-snapshot
A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications
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.