On the public citation graph

On the Nonexistence of Perfect Codes over Finite Fields

0 signed · 216 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.1002/9781118188194.ch4openalex-snapshot
Error‐Correcting Codes
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb02410.xopenalex-snapshot
Binary Block Coding
inferredcites →https://doi.org/10.1007/bfb0067908openalex-snapshot
Coding Theory
inferredcites →https://doi.org/10.1016/s0019-9958(64)90454-1openalex-snapshot
A note on perfect double error-correcting codes on q symbols
inferredcites →https://doi.org/10.1016/s0019-9958(68)90167-8openalex-snapshot
On linear and nonlinear single-error-correcting q-nary perfect codes
inferredcites →https://doi.org/10.1016/s0019-9958(68)91038-3openalex-snapshot
On the non-existence of perfect double hamming-error-correcting codes on q = 8 and q = 9 symbols
inferredcites →https://doi.org/10.1016/s0019-9958(70)90213-5openalex-snapshot
On the nonexistence of perfect 2- and 3-hamming-error-correcting codes over GF(q)
inferredcites →https://doi.org/10.1016/s0021-9800(68)80067-5openalex-snapshot
On the uniqueness of the Golay codes
inferredcites →https://doi.org/10.1016/s0022-0000(68)80030-3openalex-snapshot
On the nonexistence of close-packed double Hamming-error-correcting codes on q=7 symbols
inferredcites →https://doi.org/10.1017/cbo9781139172769.010openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1147/rd.31.0025openalex-snapshot
On the Mathematical Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.7146/math.scand.a-10952openalex-snapshot
On Group and Nongroup Perfect Codes in $q$ Symbols.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118032749.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/jcd.20083openalex-snapshot
On partitions of the q‐ary Hamming space into few spheres
inferred← citeshttps://doi.org/10.1002/jcd.21327openalex-snapshot
On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
inferred← citeshttps://doi.org/10.1002/jcd.21947openalex-snapshot
Multifold 1‐perfect codes
inferred← citeshttps://doi.org/10.1002/mana.19961820106openalex-snapshot
On the Non ‐ Existence of Perfect Codes with Rank Distance
inferred← citeshttps://doi.org/10.1002/rsa.20666openalex-snapshot
Applications of graph containers in the Boolean lattice
inferred← citeshttps://doi.org/10.1006/aama.2000.0688openalex-snapshot
Perfect Two-Fault Tolerant Search with Minimum Adaptiveness
inferred← citeshttps://doi.org/10.1006/jcta.1996.0038openalex-snapshot
On Integral Zeros of Krawtchouk Polynomials
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_46openalex-snapshot
Least Adaptive Optimal Search with Unreliable Tests
inferred← citeshttps://doi.org/10.1007/978-1-4613-3554-2_9openalex-snapshot
The Unity of Combinatorics
inferred← citeshttps://doi.org/10.1007/978-1-4613-8994-1_5openalex-snapshot
Perfect Multiple Coverings in Metric Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4757-2319-9_5openalex-snapshot
Error Correction I: Distance Concepts and Bounds
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_25openalex-snapshot
Switchings and Perfect Codes
inferred← citeshttps://doi.org/10.1007/978-1-4899-3795-7_5openalex-snapshot
G
inferred← citeshttps://doi.org/10.1007/978-3-030-00312-8_18openalex-snapshot
On Perfect Codes and Related Concepts
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_17openalex-snapshot
Perfect, Hamming and Simplex Linear Error-Block Codes with Minimum $$\pi $$-distance 3
inferred← citeshttps://doi.org/10.1007/978-3-319-93821-9_3openalex-snapshot
Hierarchical Posets
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_54openalex-snapshot
Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_1openalex-snapshot
Prologue: What This Book Is About
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_2openalex-snapshot
Fault-Tolerant Search à la Ulam-Rényi
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_3openalex-snapshot
Adaptive vs. Non-adaptive Search
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_4openalex-snapshot
Weighted Errors over a General Channel
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_5openalex-snapshot
Variations on a Theme of Ulam and Rényi: More Types of Questions and Lies
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_6openalex-snapshot
Delays and Time Outs
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_7openalex-snapshot
Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_8openalex-snapshot
Resilient Search
inferred← citeshttps://doi.org/10.1007/978-3-642-17327-1_9openalex-snapshot
A Model for Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-23490-3_28openalex-snapshot
Golay Code Clustering for Mobility Behavior Similarity Classification in Pocket Switched Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-05594-6_12openalex-snapshot
Learning and the Art of Fault-Tolerant Guesswork
inferred← citeshttps://doi.org/10.1007/978-3-662-05594-6_9openalex-snapshot
The Statistical Physics of Learning: Phase Transitions and Dynamical Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-88-470-2107-5_10openalex-snapshot
Rota-Metropolis cubic logic and Ulam-Rényi games
inferred← citeshttps://doi.org/10.1007/978-94-007-0080-2_8openalex-snapshot
Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-0501-6_2openalex-snapshot
Orthogonal Polynomials in Coding Theory and Algebraic Combinatorics
inferred← citeshttps://doi.org/10.1007/978-94-009-5983-5_2openalex-snapshot
B
inferred← citeshttps://doi.org/10.1007/978-94-009-5994-1_2openalex-snapshot
E
inferred← citeshttps://doi.org/10.1007/978-94-009-5997-2_2openalex-snapshot
G
inferred← citeshttps://doi.org/10.1007/978-94-010-1220-1_15openalex-snapshot
Permutation Groups on Unordered Sets
inferred← citeshttps://doi.org/10.1007/978-94-010-1826-5_8openalex-snapshot
Recent Results on Perfect Codes and Related Topics
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7_2openalex-snapshot
The Basis of Code Theory
inferred← citeshttps://doi.org/10.1007/bf01084252openalex-snapshot
Algebraic theory of block codes detecting independent errors
inferred← citeshttps://doi.org/10.1007/bf01189254openalex-snapshot
Characterisations of some Steiner systems, parallelisms, and biplanes
inferred← citeshttps://doi.org/10.1007/bf01788088openalex-snapshot
On the nonexistence of nontrivial perfecte-codes and tight 2e-designs in hamming schemesH(n, q) withe ≥ 3 andq ≥ 3
inferred← citeshttps://doi.org/10.1007/bf02997777openalex-snapshot
A decoding algorithm for the (23, 12, 7) golay code with error and erasure correction
inferred← citeshttps://doi.org/10.1007/bfb0017162openalex-snapshot
On the computational complexity of codes in graphs
inferred← citeshttps://doi.org/10.1007/bfb0062984openalex-snapshot
Some aspects of coding theory between probability, algebra, combinatorics and complexity theory
inferred← citeshttps://doi.org/10.1007/s002000050080openalex-snapshot
On New Perfect Binary Nonlinear Codes
inferred← citeshttps://doi.org/10.1007/s00208-003-0440-yopenalex-snapshot
Self-dual codes over the Kleinian four group
inferred← citeshttps://doi.org/10.1007/s10623-006-0024-4openalex-snapshot
On the classification of perfect codes: side class structures
inferred← citeshttps://doi.org/10.1007/s10623-007-9133-yopenalex-snapshot
On perfect p-ary codes of length p + 1
inferred← citeshttps://doi.org/10.1007/s10623-007-9135-9openalex-snapshot
A coding problem in steganography
inferred← citeshttps://doi.org/10.1007/s10623-008-9193-7openalex-snapshot
A family of ternary quasi-perfect BCH codes
inferred← citeshttps://doi.org/10.1007/s10623-010-9470-0openalex-snapshot
A family of constacyclic ternary quasi-perfect codes with covering radius 3
inferred← citeshttps://doi.org/10.1007/s10623-015-0066-6openalex-snapshot
Perfect codes in Doob graphs
inferred← citeshttps://doi.org/10.1007/s10623-018-0586-yopenalex-snapshot
Additive perfect codes in Doob graphs
inferred← citeshttps://doi.org/10.1007/s10623-019-00624-xopenalex-snapshot
Steganographic schemes from perfect codes on Cayley graphs
inferred← citeshttps://doi.org/10.1007/s10623-022-01148-7openalex-snapshot
Perfect LRCs and k-optimal LRCs
inferred← citeshttps://doi.org/10.1007/s10623-023-01240-6openalex-snapshot
Characterizing subgroup perfect codes by 2-subgroups
inferred← citeshttps://doi.org/10.1007/s10623-023-01256-yopenalex-snapshot
Projective tilings and full-rank perfect codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01364-3openalex-snapshot
Perfect mixed codes from generalized Reed–Muller codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01767-wopenalex-snapshot
Alphabet-affine 2-neighbour-transitive codes
inferred← citeshttps://doi.org/10.1007/s11202-008-0036-6openalex-snapshot
Intersections of q-ary perfect codes
inferred← citeshttps://doi.org/10.1007/s12095-015-0132-yopenalex-snapshot
Quasi-perfect linear codes from planar and APN functions
inferred← citeshttps://doi.org/10.1007/s13369-013-0564-7openalex-snapshot
On the Existence of Perfect Linear Codes Over $${{\mathbb{Z}}_{{2^{l}}}}$$ with Respect to Homogenous Metric
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90028-3openalex-snapshot
Two theorems on perfect codes
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90036-2openalex-snapshot
A survey of constructive coding theory, and a table of binary codes of highest known rate
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90047-3openalex-snapshot
Unrestricted codes with the golay parameters are unique
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90152-2openalex-snapshot
Nonexistence of nontrivial perfect codes in case q = pr1p12,e ⩾ 3
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90090-0openalex-snapshot
Lloyd's theorem for perfect codes
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90215-3openalex-snapshot
Maximal partial spreads and two-weight codes
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90404-hopenalex-snapshot
A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
inferred← citeshttps://doi.org/10.1016/0095-8956(73)90042-7openalex-snapshot
Perfect codes in graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(75)90087-8openalex-snapshot
Perfect codes in the graphs Ok
inferred← citeshttps://doi.org/10.1016/0097-3165(77)90042-5openalex-snapshot
Codes projectifs à deux poids, “caps” complets et ensembles de différences
inferred← citeshttps://doi.org/10.1016/0097-3165(77)90079-6openalex-snapshot
On perfect codes in the hamming schemes H(n, q) with q arbitrary
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90106-mopenalex-snapshot
Classification of a class of distance-regular graphs via completely regular codes
inferred← citeshttps://doi.org/10.1016/b0-12-227410-5/00167-8openalex-snapshot
Designs and Error-Correcting Codes
inferred← citeshttps://doi.org/10.1016/b978-0-12-103550-1.50015-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-12-103560-0.50012-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-408-70913-2.50012-7openalex-snapshot
Combinatorics
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50016-6openalex-snapshot
10.1016/b978-044488002-4/50016-6
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50018-xopenalex-snapshot
10.1016/b978-044488002-4/50018-x
inferred← citeshttps://doi.org/10.1016/j.dam.2005.10.023openalex-snapshot
On perfect binary codes
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.042openalex-snapshot
Classification of perfect and total perfect codes in generalized Petersen graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.008openalex-snapshot
On non-antipodal binary completely regular codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.037openalex-snapshot
Perfect codes from the dual point of view I
inferred← citeshttps://doi.org/10.1016/j.disc.2011.03.024openalex-snapshot
The non-existence of some perfect codes over non-prime power alphabets
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.009openalex-snapshot
A note on the symmetry group of full rank perfect binary codes
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112128openalex-snapshot
On existence of perfect bitrades in Hamming graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103604openalex-snapshot
On the classification of binary completely transitive codes with almost-simple top-group
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102617openalex-snapshot
On self-dual completely regular codes with covering radius ρ ≤ 3
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.03.007openalex-snapshot
Jack van Lint (1932–2004): A survey of his scientific work
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105173openalex-snapshot
Minimal binary 2-neighbour-transitive codes
inferred← citeshttps://doi.org/10.1016/j.jspi.2005.10.005openalex-snapshot
Perfect minimally adaptive -ary search with unreliable tests
inferred← citeshttps://doi.org/10.1016/j.laa.2005.03.001openalex-snapshot
On some perfect codes with respect to Lee metric
inferred← citeshttps://doi.org/10.1016/j.tpb.2019.03.007openalex-snapshot
Match fitness landscapes for macromolecular interaction networks: Selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases
inferred← citeshttps://doi.org/10.1016/s0019-9958(73)80007-5openalex-snapshot
Four fundamental parameters of a code and their combinatorial significance
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90101-7openalex-snapshot
Generalized t-designs and majority decoding of linear codes
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90519-8openalex-snapshot
All nearly perfect codes are known
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90461-7openalex-snapshot
A modification of the elias-bound and nonexistence theorems for perfect codes in the Lee-metric
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00352-8openalex-snapshot
Structure of i-components of perfect binary codes
inferred← citeshttps://doi.org/10.1016/s0195-6698(86)80015-4openalex-snapshot
Upper Bounds for the Cardinality of s-Distances Codes
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73594-1openalex-snapshot
Caps Related to Incidence Structures and to Linear Codes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00116-5openalex-snapshot
Least adaptive optimal search with unreliable tests
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70549-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(13)70005-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0924-6509(97)80023-2openalex-snapshot
Complexity
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00352-xopenalex-snapshot
On completely regular binary codes and t-designs∗
inferred← citeshttps://doi.org/10.1017/9781009067928.004openalex-snapshot
Linear Block Codes
inferred← citeshttps://doi.org/10.1017/cbo9781139059534openalex-snapshot
A Student's Guide to Coding and Information Theory
inferred← citeshttps://doi.org/10.1017/cbo9781316529836openalex-snapshot
Designs and their Codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.002openalex-snapshot
Designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.003openalex-snapshot
Codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.004openalex-snapshot
The geometry of vector spaces
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.005openalex-snapshot
Symmetric Designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.006openalex-snapshot
The standard geometric codes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.007openalex-snapshot
Codes from planes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.008openalex-snapshot
Hadamard designs
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.009openalex-snapshot
Steiner systems
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.010openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.011openalex-snapshot
Glossary
inferred← citeshttps://doi.org/10.1017/s0305004110000678openalex-snapshot
Irredundant families of subcubes
inferred← citeshttps://doi.org/10.1023/a:1008394205999openalex-snapshot
On Perfect Codes and Related Concepts
inferred← citeshttps://doi.org/10.1080/00029890.1977.11994294openalex-snapshot
Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
inferred← citeshttps://doi.org/10.1080/00029890.1980.11995087openalex-snapshot
On the Weight Distributions of Cosets of a Linear Code
inferred← citeshttps://doi.org/10.1080/00029890.1995.12004624openalex-snapshot
Football Pools--A Game for Mathematicians
inferred← citeshttps://doi.org/10.1080/0025570x.1979.11976758openalex-snapshot
Codes and Designs
inferred← citeshttps://doi.org/10.1080/01969727708927544openalex-snapshot
ADJACENT-ERROR CORRECTING BINARY PERFECT CODES
inferred← citeshttps://doi.org/10.1080/01969727708927560openalex-snapshot
PHASED ERROR CORRECTING PERFECT CODES
inferred← citeshttps://doi.org/10.1080/09720502.2004.10700359openalex-snapshot
Ternary (1, 2) optimal linear codes
inferred← citeshttps://doi.org/10.1080/09720502.2006.10700446openalex-snapshot
(1, 2) Optimal codes over GF(5)
inferred← citeshttps://doi.org/10.1080/09720529.2008.10698162openalex-snapshot
On perfect codes in rank distance
inferred← citeshttps://doi.org/10.1101/312462openalex-snapshot
Adaptive Partitioning of the tRNA Interaction Interface by Aminoacyl-tRNA-Synthetases
inferred← citeshttps://doi.org/10.1109/18.335887openalex-snapshot
Perfect binary codes: constructions, properties, and enumeration
inferred← citeshttps://doi.org/10.1109/18.556115openalex-snapshot
Translation-invariant propelinear codes
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/18.771247openalex-snapshot
A characterization of 1-perfect additive codes
inferred← citeshttps://doi.org/10.1109/18.817528openalex-snapshot
On the nonexistence of completely transitive codes
inferred← citeshttps://doi.org/10.1109/18.923747openalex-snapshot
Nonexistence of completely transitive codes with error-correcting capability e<3
inferred← citeshttps://doi.org/10.1109/icc.1991.162522openalex-snapshot
Some new double-error correcting quasi-perfect codes
inferred← citeshttps://doi.org/10.1109/icde.2012.66openalex-snapshot
Fuzzy Joins Using MapReduce
inferred← citeshttps://doi.org/10.1109/isit.1997.613387openalex-snapshot
On perfect codes and tilings: problems and solutions
inferred← citeshttps://doi.org/10.1109/isit.2000.866675openalex-snapshot
Perfect, minimally adaptive, error-correcting searching strategies
inferred← citeshttps://doi.org/10.1109/isit.2008.4595061openalex-snapshot
The algebraic degree of 1-perfect binary codes and a relation with the code characters
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619542openalex-snapshot
Perfect Multi-User Distributed Computing
inferred← citeshttps://doi.org/10.1109/itcc.2001.918853openalex-snapshot
New bounds on a hypercube coloring problem and linear codes
inferred← citeshttps://doi.org/10.1109/itw.2006.1633779openalex-snapshot
Perfect Codes in the Johnson Schemes
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959879openalex-snapshot
Coding theory: Tutorial & survey
inferred← citeshttps://doi.org/10.1109/socc66126.2025.11235429openalex-snapshot
Lightweight Error-Correction Code Encoders in Superconducting Electronic Systems
inferred← citeshttps://doi.org/10.1109/sp.2009.24openalex-snapshot
Privacy Weaknesses in Biometric Sketches
inferred← citeshttps://doi.org/10.1109/tit.1975.1055398openalex-snapshot
A class of binoid single-error-correcting codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.1979.1055991openalex-snapshot
On some properties of the undetected error probability of linear codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.1981.1056379openalex-snapshot
Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights
inferred← citeshttps://doi.org/10.1109/tit.1982.1056443openalex-snapshot
An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.2004.833355openalex-snapshot
Perfect Constant-Weight Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928277openalex-snapshot
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions
inferred← citeshttps://doi.org/10.1109/tit.2008.929971openalex-snapshot
The Algebraic Degree of Perfect Binary Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2054512openalex-snapshot
A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2946612openalex-snapshot
The Existence of Perfect Codes in Doob Graphs
inferred← citeshttps://doi.org/10.1109/tit.2019.2946660openalex-snapshot
How Many Weights Can a Cyclic Code Have?
inferred← citeshttps://doi.org/10.1109/tit.2023.3296754openalex-snapshot
Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic
inferred← citeshttps://doi.org/10.1109/tit.2023.3340664openalex-snapshot
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric
inferred← citeshttps://doi.org/10.1109/tit.2024.3521328openalex-snapshot
Covering b-Symbol Metric Codes and the Generalized Singleton Bound
inferred← citeshttps://doi.org/10.1109/tit.2025.3544025openalex-snapshot
Determining the Covering Radius of All Generalized Zetterberg Codes in Odd Characteristic
inferred← citeshttps://doi.org/10.1109/tit.2026.3697587openalex-snapshot
Covering Radius of Generalized Zetterberg Codes of Even Characteristic
inferred← citeshttps://doi.org/10.1134/s0032946007020032openalex-snapshot
On new completely regular q-ary codes
inferred← citeshttps://doi.org/10.1134/s0032946008040029openalex-snapshot
On perfect codes for an additive channel
inferred← citeshttps://doi.org/10.1134/s0032946019010010openalex-snapshot
On Completely Regular Codes
inferred← citeshttps://doi.org/10.1134/s1064562406060123openalex-snapshot
Perfect codes in additive channels
inferred← citeshttps://doi.org/10.1134/s1990478908020105openalex-snapshot
Survey of the methods for constructing nonlinear perfect binary codes
inferred← citeshttps://doi.org/10.1134/s1990478910010163openalex-snapshot
Constructions of partitions of F N q into perfect q-ary codes
inferred← citeshttps://doi.org/10.1134/s1990478923020205openalex-snapshot
A Testing Set for Preparata-Like Codes
inferred← citeshttps://doi.org/10.1137/060658643openalex-snapshot
Perfect Codes of Length n with Kernels of Dimension $n-\log(n+1)-3$
inferred← citeshttps://doi.org/10.1137/1016056openalex-snapshot
Coding and Combinatorics
inferred← citeshttps://doi.org/10.1137/19m1258013openalex-snapshot
Subgroup Perfect Codes in Cayley Graphs
inferred← citeshttps://doi.org/10.1137/s0895480196309171openalex-snapshot
On Perfect Codes and Tilings: Problems and Solutions
inferred← citeshttps://doi.org/10.1142/9789812837172_0004openalex-snapshot
CODING THEORY AND ALGEBRAIC COMBINATORICS
inferred← citeshttps://doi.org/10.1155/2014/971410openalex-snapshot
Weight Distribution of Periodic Errors and Optimal/Anti-Optimal Linear Codes
inferred← citeshttps://doi.org/10.1201/b11707-27openalex-snapshot
C Tables in Finite Fields
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.1216/rmj-1975-5-2-199openalex-snapshot
A survey of perfect codes
inferred← citeshttps://doi.org/10.14209/sbrt.2018.1openalex-snapshot
The Hamming and Golay Number-Theoretic Transforms
inferred← citeshttps://doi.org/10.14209/sbrt.2018.179openalex-snapshot
von Mises, tapering function, windows, circulardistributions, apodization.
inferred← citeshttps://doi.org/10.1504/ijicot.2013.059702openalex-snapshot
New families of perfect linear error-block codes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.22436/jmcs.07.04.04openalex-snapshot
Difference Equations And Sbec Optimal Codes
inferred← citeshttps://doi.org/10.26493/1855-3974.1240.515openalex-snapshot
Alphabet-almost-simple 2-neighbour-transitive codes
inferred← citeshttps://doi.org/10.32604/cmc.2022.025245openalex-snapshot
Quaternion Integers Based Higher Length Cyclic Codes and Their Decoding Algorithm
inferred← citeshttps://doi.org/10.3390/math10162994openalex-snapshot
Two-State Alien Tiles: A Coding-Theoretical Perspective
inferred← citeshttps://doi.org/10.3390/math12111642openalex-snapshot
Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations
inferred← citeshttps://doi.org/10.3390/math13162633openalex-snapshot
Reduction and Efficient Solution of ILP Models of Mixed Hamming Packings Yielding Improved Upper Bounds
inferred← citeshttps://doi.org/10.37236/8040openalex-snapshot
$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity
inferred← citeshttps://doi.org/10.3836/tjm/1270151223openalex-snapshot
Homogeneity Theorems on Perfect Codes in Hamming Schemes and Generalized Hamming Schemes
inferred← citeshttps://doi.org/10.3934/amc.2010.4.567openalex-snapshot
On $q$-ary linear completely regular codes with $\rho=2$ and antipodal dual
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.829259openalex-snapshot
Identidades de MacWilliams para métricas Poset-Block
inferred← citeshttps://doi.org/10.48550/arxiv.0901.2062openalex-snapshot
Notes on Reed-Muller Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4882openalex-snapshot
Properties of Codes in the Johnson Scheme
inferred← citeshttps://doi.org/10.48550/arxiv.1405.5427openalex-snapshot
Characterisation of a family of neighbour transitive codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0505072openalex-snapshot
Steganographic Codes -- a New Problem of Coding Theory
showing the first 200 of 202 · page through all 202
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.