On the public citation graph
Coding and Combinatorics
0 signed · 164 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1952.tb01393.xopenalex-snapshot
A Comparison of Signalling Alphabets
inferredcites →https://doi.org/10.1002/j.1538-7305.1956.tb02379.xopenalex-snapshot
A Class of Binary Signaling Alphabets
inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb02410.xopenalex-snapshot
Binary Block Coding
inferredcites →https://doi.org/10.1002/j.1538-7305.1963.tb04003.xopenalex-snapshot
A Theorem on the Distribution of Weights in a Systematic Code†
inferredcites →https://doi.org/10.1002/j.1538-7305.1972.tb01947.xopenalex-snapshot
The MacWilliams Identities for Nonlinear Codes
inferredcites →https://doi.org/10.1007/bf01899857openalex-snapshot
Perfect codes and the Mathieu groups
inferredcites →https://doi.org/10.1016/0001-8708(73)90114-xopenalex-snapshot
Blocking sets, k-arcs and nets of order ten
inferredcites →https://doi.org/10.1016/0012-365x(72)90021-0openalex-snapshot
On weights in quadratic-residue codes
inferredcites →https://doi.org/10.1016/0012-365x(72)90022-2openalex-snapshot
Contractions of self-orthogonal codes
inferredcites →https://doi.org/10.1016/0022-314x(72)90057-1openalex-snapshot
Euler products, cyclotomy, and coding
inferredcites →https://doi.org/10.1016/0097-3165(72)90088-xopenalex-snapshot
Symmetry codes over GF(3) and new five-designs
inferredcites →https://doi.org/10.1016/0097-3165(73)90064-2openalex-snapshot
On the existence of a projective plane of order 10
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50022-3openalex-snapshot
Some Combinatorial Aspects of Coding Theory
inferredcites →https://doi.org/10.1016/s0019-9958(60)90287-4openalex-snapshot
On a class of error correcting binary group codes
inferredcites →https://doi.org/10.1016/s0019-9958(62)90298-xopenalex-snapshot
On the number of information symbols in Bose-Chaudhuri codes
inferredcites →https://doi.org/10.1016/s0019-9958(63)80010-8openalex-snapshot
Error-correcting codes: An axiomatic approach
inferredcites →https://doi.org/10.1016/s0019-9958(63)90189-xopenalex-snapshot
Power moment identities on weight distributions in error correcting codes
inferredcites →https://doi.org/10.1016/s0019-9958(65)90080-xopenalex-snapshot
Algebraically punctured cyclic codes
inferredcites →https://doi.org/10.1016/s0019-9958(67)90691-2openalex-snapshot
Some results on cyclic codes which are invariant under the affine group and their applications
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(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/s0019-9958(73)80007-5openalex-snapshot
Four fundamental parameters of a code and their combinatorial significance
inferredcites →https://doi.org/10.1016/s0021-9800(67)80025-5openalex-snapshot
On tactical configurations and error-correcting codes
inferredcites →https://doi.org/10.1016/s0021-9800(68)80067-5openalex-snapshot
On the uniqueness of the Golay codes
inferredcites →https://doi.org/10.1090/s0002-9904-1969-12135-xopenalex-snapshot
Sphere-packing in the Hamming metric
inferredcites →https://doi.org/10.1090/s0025-5718-1969-0257039-xopenalex-snapshot
Factorization of Polynomials Over Finite Fields
inferredcites →https://doi.org/10.1109/jrproc.1957.278458openalex-snapshot
1957 IRE National Convention Record
inferredcites →https://doi.org/10.1109/tit.1958.1057456openalex-snapshot
Notes on the penny-weighing problem, lossless symbol coding with nonprimes, etc.
inferredcites →https://doi.org/10.1109/tit.1967.1053994openalex-snapshot
A class of majority logic decodable codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1967.1054053openalex-snapshot
Limit distribution of the minimum distance of random linear codes
inferredcites →https://doi.org/10.1109/tit.1972.1054817openalex-snapshot
Gleason's theorem on self-dual codes
inferredcites →https://doi.org/10.1109/tit.1972.1054893openalex-snapshot
Class of constructive asymptotically good algebraic codes
inferredcites →https://doi.org/10.1109/tit.1972.1054898openalex-snapshot
Generalizations of Gleason's theorem on weight enumerators of self-dual codes
inferredcites →https://doi.org/10.1112/blms/1.1.79openalex-snapshot
A Group of Order 8,315,553,613,086,720,000
inferredcites →https://doi.org/10.1112/s0025579300005635openalex-snapshot
Sphere packings constructed from BCH and Justesen codes
inferredcites →https://doi.org/10.1137/0109055openalex-snapshot
A New Treatment of Bose-Chaudhuri Codes
inferredcites →https://doi.org/10.1137/0121041openalex-snapshot
Blocking Sets in Finite Projective Planes
inferredcites →https://doi.org/10.1137/0124010openalex-snapshot
On the Nonexistence of Perfect Codes over Finite Fields
inferredcites →https://doi.org/10.1137/1.9781611971927.ch2openalex-snapshot
2. Orthogonal Polynomials
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting Codes
inferredcites →https://doi.org/10.2307/2983576openalex-snapshot
Factorial Experiments Derivable from Combinatorial Arrangements of Arrays
inferredcites →https://doi.org/10.24033/asens.1223openalex-snapshot
Polynômes des poids de certains codes et fonctions thêta de certains réseaux
inferredcites →https://doi.org/10.4153/cjm-1960-014-0openalex-snapshot
A Metrization for Power-Sets with Applications to Combinatorial Analysis
inferredcites →https://doi.org/10.4153/cjm-1971-081-3openalex-snapshot
Sphere Packings and 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.1002/9781119582397.ch23openalex-snapshot
MDS Codes, Secret Sharing, and Invariant Theory
inferred← citeshttps://doi.org/10.1002/jcd.21565openalex-snapshot
An Infinite Family of Steiner Systems from Cyclic Codes
inferred← citeshttps://doi.org/10.1007/0-387-29852-5_5openalex-snapshot
Hadamard’s determinant problem
inferred← citeshttps://doi.org/10.1007/978-0-387-89486-7_5openalex-snapshot
Hadamard’s Determinant Problem
inferred← citeshttps://doi.org/10.1007/978-1-4684-8223-2_10openalex-snapshot
Special Mathematical Topics
inferred← citeshttps://doi.org/10.1007/978-3-319-55589-8_8openalex-snapshot
Parameters of 2-Designs from Some BCH Codes
inferred← citeshttps://doi.org/10.1007/978-94-011-7577-7_10openalex-snapshot
Codes Associated with Finite Geometries
inferred← citeshttps://doi.org/10.1007/bf01084252openalex-snapshot
Algebraic theory of block codes detecting independent errors
inferred← citeshttps://doi.org/10.1007/bf01221886openalex-snapshot
Self-orthogonal Steiner systems and projective planes
inferred← citeshttps://doi.org/10.1007/bf01810572openalex-snapshot
Polynomial description of binary linear codes and related properties
inferred← citeshttps://doi.org/10.1007/bfb0019846openalex-snapshot
New bounds on cyclic codes from algebraic curves
inferred← citeshttps://doi.org/10.1007/s10623-017-0352-6openalex-snapshot
Infinite families of 3-designs from a type of five-weight code
inferred← citeshttps://doi.org/10.1007/s10623-017-0395-8openalex-snapshot
A construction of group divisible designs with block sizes 3 to 7
inferred← citeshttps://doi.org/10.1007/s10623-018-0478-1openalex-snapshot
Several classes of linear codes with a few weights from defining sets over $$\mathbb {F}_p+u\mathbb {F}_p$$ F p + u F p
inferred← citeshttps://doi.org/10.1007/s10623-019-00651-8openalex-snapshot
Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$
inferred← citeshttps://doi.org/10.1007/s12095-020-00442-2openalex-snapshot
Combinatorial t-designs from special functions
inferred← citeshttps://doi.org/10.1016/0021-8693(78)90266-1openalex-snapshot
Codes over GF(4) and complex lattices
inferred← citeshttps://doi.org/10.1016/0097-3165(78)90021-3openalex-snapshot
Self-dual codes over GF(4)
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.disc.2017.05.013openalex-snapshot
Infinite families of 2 -designs and 3 -designs from linear codes
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114643openalex-snapshot
Two new families of linear codes with five Lee-weights over Fq+uFq and their Gray images
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102510openalex-snapshot
Few-weight linear codes over F p from t-to-one mappings
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70187-0openalex-snapshot
An Updated Bibliography and Survey of Steiner Systems
inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80004-8openalex-snapshot
Arcs in Planes of Even Order
inferred← citeshttps://doi.org/10.1017/cbo9780511800467openalex-snapshot
Algebraic Codes for Data Transmission
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.006openalex-snapshot
The Arithmetic of Galois Fields
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.008openalex-snapshot
Codes Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.009openalex-snapshot
Algorithms Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.013openalex-snapshot
Codes and Algorithms Based on Graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.014openalex-snapshot
Performance of Error-Control Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.015openalex-snapshot
Codes and Algorithms for Majority Decoding
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.004openalex-snapshot
The geometry of vector spaces
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.006openalex-snapshot
The standard geometric codes
inferred← citeshttps://doi.org/10.1023/a:1008338101197openalex-snapshot
Edward F. Assmus, Jr. (1931–1998)
inferred← citeshttps://doi.org/10.1049/iet-com.2011.0318openalex-snapshot
Soft decoding of the (23, 12, 7) Golay-code up to five errors
inferred← citeshttps://doi.org/10.1049/iet-com:20080037openalex-snapshot
Decoding of the (24, 12, 8) extended Golay code up to four errors
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.1978.11994535openalex-snapshot
Nonexistence Proofs for Projective Designs
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.1981.11995202openalex-snapshot
Planes, Biplanes, and their Codes
inferred← citeshttps://doi.org/10.1080/00029890.1984.11971483openalex-snapshot
Introduction to Coding Theory. By J. H. van Lint
inferred← citeshttps://doi.org/10.1080/07468342.1988.11973147openalex-snapshot
Codes That Detect and Correct Errors
inferred← citeshttps://doi.org/10.1090/conm/634/12693openalex-snapshot
Foundations of Algebraic Coding Theory
inferred← citeshttps://doi.org/10.1090/conm/826/16573openalex-snapshot
Codes constructed from matrices associated with Lie algebras
inferred← citeshttps://doi.org/10.1090/conm/826/16588openalex-snapshot
Weights with maximal symmetry and failures of the MacWilliams identities
inferred← citeshttps://doi.org/10.1109/18.144719openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
inferred← citeshttps://doi.org/10.1109/18.382022openalex-snapshot
Shadow codes and weight enumerators
inferred← citeshttps://doi.org/10.1109/18.720545openalex-snapshot
Association schemes and coding theory
inferred← citeshttps://doi.org/10.1109/18.771247openalex-snapshot
A characterization of 1-perfect additive codes
inferred← citeshttps://doi.org/10.1109/tit.1976.1055522openalex-snapshot
Review of 'The Mathematical Theory of Coding' (Blake, I. F., and Mullin, R. C.; 1975)
inferred← citeshttps://doi.org/10.1109/tit.1976.1055556openalex-snapshot
Some 3-error-correcting BCH codes have covering radius 5 (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.1976.1055617openalex-snapshot
An optimum symbol-by-symbol decoding rule for linear codes
inferred← citeshttps://doi.org/10.1109/tit.1978.1055903openalex-snapshot
The weight-distribution of a coset of a linear code (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.1983.1056681openalex-snapshot
On the coveting radius of extremal self-dual codes
inferred← citeshttps://doi.org/10.1109/tit.1985.1057043openalex-snapshot
Covering radius---Survey and recent results
inferred← citeshttps://doi.org/10.1109/tit.2003.814490openalex-snapshot
The rank and kernel of extended 1-perfect Z/sub 4/-linear and additive non- Z/sub 4/-linear codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2959764openalex-snapshot
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
inferred← citeshttps://doi.org/10.1109/tit.2022.3145519openalex-snapshot
Shortened Linear Codes From APN and PN Functions
inferred← citeshttps://doi.org/10.1137/0131058openalex-snapshot
Self-Dual Codes over ${\text{GF}}( 3 )$
inferred← citeshttps://doi.org/10.1142/9789812837172_0004openalex-snapshot
CODING THEORY AND ALGEBRAIC COMBINATORICS
inferred← citeshttps://doi.org/10.1177/0008068319900507openalex-snapshot
Association Schemes, Orthogonal Arrays and Codes from Non‐Degenerate Quadrics and Hermitian Varieties in Finite Projective Geometries
inferred← citeshttps://doi.org/10.13023/etd.2019.014openalex-snapshot
Equivalence of Classical and Quantum Codes
inferred← citeshttps://doi.org/10.1353/ajm.1999.0024openalex-snapshot
Duality for modules over finite rings and applications to coding theory
inferred← citeshttps://doi.org/10.1561/0100000044openalex-snapshot
Combinatorial Designs for Authentication and Secrecy Codes
inferred← citeshttps://doi.org/10.1561/9781601983596openalex-snapshot
Combinatorial Designs for Authentication and Secrecy Codes
inferred← citeshttps://doi.org/10.3390/axioms13080495openalex-snapshot
Matrix Factorization and Some Fast Discrete Transforms
inferred← citeshttps://doi.org/10.3934/amc.2020088openalex-snapshot
Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2025002openalex-snapshot
Five-Lee-weight linear codes over $ \mathbb{F}_{q}+u\mathbb{F}_{q} $
inferred← citeshttps://doi.org/10.3934/amc.2026012openalex-snapshot
Linear codes with few weights over $ \mathbb{F}_{p}+u\mathbb{F}_{p} $
inferred← citeshttps://doi.org/10.48550/arxiv.1607.04815openalex-snapshot
Infinite families of $t$-designs from a type of five-weight codes
inferred← citeshttps://doi.org/10.48550/arxiv.1612.09397openalex-snapshot
A construction of group divisible designs with zero block sum
inferred← citeshttps://doi.org/10.48550/arxiv.1701.05965openalex-snapshot
An infinite family of Steiner systems $S(2, 4, 2^m)$ from cyclic codes
inferred← citeshttps://doi.org/10.48550/arxiv.1811.07725openalex-snapshot
Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1903.03720openalex-snapshot
The parameters of a family of linear codes
inferred← citeshttps://doi.org/10.5860/choice.40-3454openalex-snapshot
Adventures in group theory: Rubik's Cube, Merlin's machine, and other mathematical toys
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.