On the public citation graph

On designs and formally self-dual codes

0 signed · 74 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.1016/0012-365x(72)90034-9openalex-snapshot
A classification of self-orthogonal codes over GF(2)
inferredcites →https://doi.org/10.1016/0012-365x(92)90574-yopenalex-snapshot
The [18, 9, 6] code is unique
inferredcites →https://doi.org/10.1016/0097-3165(75)90042-4openalex-snapshot
On the classification and enumeration of self-dual codes
inferredcites →https://doi.org/10.1016/0097-3165(76)90071-6openalex-snapshot
A restriction on the weight enumerator of a self-dual code
inferredcites →https://doi.org/10.1016/0097-3165(78)90021-3openalex-snapshot
Self-dual codes over GF(4)
inferredcites →https://doi.org/10.1016/0097-3165(80)90057-6openalex-snapshot
On the enumeration of self-dual codes
inferredcites →https://doi.org/10.1016/0097-3165(87)90056-2openalex-snapshot
On weights in duadic codes
inferredcites →https://doi.org/10.1016/0097-3165(92)90003-dopenalex-snapshot
The binary self-dual codes of length up to 32: A revised enumeration
inferredcites →https://doi.org/10.1016/0097-3165(93)90085-mopenalex-snapshot
Greedy codes
inferredcites →https://doi.org/10.1016/s0019-9958(71)90428-1openalex-snapshot
Majority logic decodable codes derived from finite inversive planes
inferredcites →https://doi.org/10.1016/s0019-9958(73)90273-8openalex-snapshot
An upper bound for self-dual codes
inferredcites →https://doi.org/10.1016/s0021-9800(69)80115-8openalex-snapshot
New 5-designs
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1090/pspum/034/525331openalex-snapshot
Self-dual codes and lattices
inferredcites →https://doi.org/10.1109/18.59931openalex-snapshot
A new upper bound on the minimal distance of self-dual codes
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1978.1055965openalex-snapshot
Generalized quadratic residue codes
inferredcites →https://doi.org/10.1109/tit.1979.1056047openalex-snapshot
Self-dual codes overGF(3)andGF(4)of length not exceeding 16
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.2307/2003832openalex-snapshot
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/jcd.21782openalex-snapshot
The extended binary quadratic residue code of length 42 holds a 3‐design
inferred← citeshttps://doi.org/10.1006/ffta.1996.0174openalex-snapshot
The Existence of a Self-Dual [70, 35, 12] Code and Formally Self-Dual Codes
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_2openalex-snapshot
Self-dual Codes-Theme and Variations
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_44openalex-snapshot
Binary Optimal Linear Rate 1/2 Codes
inferred← citeshttps://doi.org/10.1007/s00200-019-00409-8openalex-snapshot
LCD codes from weighing matrices
inferred← citeshttps://doi.org/10.1007/s00200-021-00497-5openalex-snapshot
Formally self-dual LCD codes from two-class association schemes
inferred← citeshttps://doi.org/10.1007/s00200-021-00532-5openalex-snapshot
LCD codes from equitable partitions of association schemes
inferred← citeshttps://doi.org/10.1007/s002000050079openalex-snapshot
Constraints on Weights in Binary Codes
inferred← citeshttps://doi.org/10.1007/s002000050126openalex-snapshot
Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7
inferred← citeshttps://doi.org/10.1007/s003730200037openalex-snapshot
Classification of Extremal Formally Self-Dual Even Codes of Length 22
inferred← citeshttps://doi.org/10.1007/s10623-008-9244-0openalex-snapshot
The nonexistence of near-extremal formally self-dual codes
inferred← citeshttps://doi.org/10.1007/s10623-009-9286-yopenalex-snapshot
A generalized Gleason–Pierce–Ward theorem
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-022-01126-zopenalex-snapshot
Guest editorial: On coding theory and combinatorics—in memory of Vera Pless
inferred← citeshttps://doi.org/10.1007/s10623-023-01185-wopenalex-snapshot
A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring $$\mathbb {F}_{2^r}[u]/$$
inferred← citeshttps://doi.org/10.1007/s10623-023-01210-yopenalex-snapshot
An improved method for constructing formally self-dual codes with small hulls
inferred← citeshttps://doi.org/10.1007/s10623-023-01310-9openalex-snapshot
Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic
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-026-01804-2openalex-snapshot
Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
inferred← citeshttps://doi.org/10.1007/s12190-024-02192-3openalex-snapshot
Characterization and classification of optimal ternary linear one-dimensional hull codes
inferred← citeshttps://doi.org/10.1007/s12190-024-02326-7openalex-snapshot
Asymptotically good four Toeplitz codes and derived new formally self-dual LCD codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00010-gopenalex-snapshot
A coding theoretic approach to extending designs
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90004-3openalex-snapshot
Weight distributions of linear codes and the Gleason-Pierce theorem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.017openalex-snapshot
Constructing formally self-dual codes over Rk
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112152openalex-snapshot
Mass formulae for Euclidean self-orthogonal and self-dual codes over finite commutative chain rings
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.012openalex-snapshot
On the classification and enumeration of self-dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.09.006openalex-snapshot
A note on formally self-dual even codes of length divisible by 8
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.01.005openalex-snapshot
Construction of isodual codes over GF(q)
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101925openalex-snapshot
On the minimum weights of binary LCD codes and ternary LCD codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.03.011openalex-snapshot
Formally self-dual additive codes over F4
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00345-0openalex-snapshot
On the classification of extremal even formally self-dual codes of lengths 20 and 22
inferred← citeshttps://doi.org/10.1023/a:1008206223659openalex-snapshot
Classification of Extremal Double Circulant Formally Self-Dual Even Codes
inferred← citeshttps://doi.org/10.1023/a:1008368615935openalex-snapshot
On Harmonic Weight Enumerators of Binary Codes
inferred← citeshttps://doi.org/10.1023/a:1008389220478openalex-snapshot
On the Classification of Extremal Even Formally Self-Dual Codes
inferred← citeshttps://doi.org/10.1023/a:1011203416769openalex-snapshot
Binary Optimal Odd Formally Self-Dual Codes
inferred← citeshttps://doi.org/10.1023/a:1011223128089openalex-snapshot
Classification of Formally Self-Dual Even Codes of Lengths up to 16
inferred← citeshttps://doi.org/10.1023/a:1011259823212openalex-snapshot
Isodual Codes over ℤ2k and Isodual Lattices
inferred← citeshttps://doi.org/10.1023/a:1024188005329openalex-snapshot
A New Class of Designs Which Protect against Quantum Jumps
inferred← citeshttps://doi.org/10.1109/18.641574openalex-snapshot
Extremal binary self-dual codes
inferred← citeshttps://doi.org/10.1109/18.841185openalex-snapshot
On cyclic reversible self-dual additive codes with odd length over Z/sub 2//sup 2/
inferred← citeshttps://doi.org/10.1109/tit.2003.822576openalex-snapshot
Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex
inferred← citeshttps://doi.org/10.1109/tit.2017.2761388openalex-snapshot
Constructions of Formally Self-Dual Codes Over $ {\mathbb Z}_{4}$ and Their Weight Enumerators
inferred← citeshttps://doi.org/10.1109/tit.2023.3288092openalex-snapshot
The Hull of Two Classical Propagation Rules and Their Applications
inferred← citeshttps://doi.org/10.1109/tit.2023.3322771openalex-snapshot
Formally Unimodular Packings for the Gaussian Wiretap Channel
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.1142/9789812837172_0004openalex-snapshot
CODING THEORY AND ALGEBRAIC COMBINATORICS
inferred← citeshttps://doi.org/10.13069/jacodesmath.645018openalex-snapshot
A class of constacyclic codes containing formally self-dual and isodual codes
inferred← citeshttps://doi.org/10.14403/jcms.2012.25.4.633openalex-snapshot
CLASSIFICATION OF BINARY FORMALLY SELF-DUAL EVEN CODES OF LENGTH 18
inferred← citeshttps://doi.org/10.2206/kyushujm.53.421openalex-snapshot
ON BINARY EXTREMAL FORMALLY SELF-DUAL EVEN CODES
inferred← citeshttps://doi.org/10.3929/ethz-b-000535284openalex-snapshot
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
inferred← citeshttps://doi.org/10.3934/amc.2009.3.311openalex-snapshot
New extremal formally self-dual even codes of length 30
inferred← citeshttps://doi.org/10.48550/arxiv.alg-geom/9711026openalex-snapshot
Symmetric matrices and quantum codes
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9711047openalex-snapshot
Quantum self-dual codes and symmetric matrices
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.