The following pages link to (Q4212172):
Displaying 50 items.
- Mutually disjoint \(t\)-designs and \(t\)-SEEDs from extremal doubly-even self-dual codes (Q404928) (← links)
- \(5\)-SEEDs from the lifted Golay code of length \(24\) over \(\mathbb{Z}_4\) (Q514546) (← links)
- Algebraic geometric codes on anticanonical surfaces (Q616327) (← links)
- Some cyclic codes of length \(2p^n\) (Q634132) (← links)
- Minimal cyclic codes of length \(p^nq\) (Q714464) (← links)
- Zeta functions for formal weight enumerators and the extremal property (Q935666) (← links)
- Dense packings from quadratic fields and codes (Q941315) (← links)
- Visualizing Vandermonde's determinant through nonintersecting lattice paths (Q972840) (← links)
- An abundance of invariant polynomials satisfying the Riemann hypothesis (Q998384) (← links)
- Configurations: A case study in mathematical beauty (Q1057872) (← links)
- On the MacWilliams identities for linear codes (Q1106177) (← links)
- Designs and self-dual codes with long shadows. (Q1427005) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Self-reciprocal polynomials and coterm polynomials (Q1650429) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- Primitive idempotents of cyclic codes of length \(p\) and 2\(p\) (Q1786982) (← links)
- Lattices of quasi-cyclic codes (Q1826968) (← links)
- Neighbour transitivity on codes in Hamming graphs (Q1949232) (← links)
- On the number of alternating paths in bipartite complete graphs (Q2014212) (← links)
- Cyclic sieving for cyclic codes (Q2031648) (← links)
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless (Q2109380) (← links)
- Siegel modular forms of weight 13 and the Leech lattice (Q2154803) (← links)
- On the minimum weights of binary linear complementary dual codes (Q2179521) (← links)
- In memoriam. A tribute to Vera Pless (1931--2020) (Q2191818) (← links)
- Configurations of extremal type II codes via harmonic weight enumerators (Q2199513) (← links)
- On the number of alternating paths in random graphs (Q2231749) (← links)
- Extremal invariant polynomials not satisfying the Riemann hypothesis (Q2321944) (← links)
- Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis (Q2329187) (← links)
- Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\) (Q2346484) (← links)
- A result on the weight distributions of binary quadratic residue codes (Q2383978) (← links)
- On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes (Q2406691) (← links)
- Primitive idempotent tables of cyclic and constacyclic codes (Q2416930) (← links)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x]/(x^{p^n} - 1)\) (Q2566960) (← links)
- Constructing few-weight linear codes and strongly regular graphs (Q2675859) (← links)
- Topological spaces via phenotype–genotype spaces (Q2809297) (← links)
- A STUDY ON EQUIVALENCE OF 1-ERROR CORRECTING [6, 2, 4] QUATERNARY CODES (Q4973451) (← links)
- (Q5010310) (← links)
- Linear codes resulting from finite group actions (Q5104012) (← links)
- BCH Codes with Minimum Distance Proportional to Code Length (Q5150816) (← links)
- Mutually Disjoint 5‐Designs and 5‐Spontaneous Emission Error Designs from Extremal Ternary Self‐Dual Codes (Q5175789) (← links)
- Nonnegative tensors revisited: plane stochastic tensors (Q5378510) (← links)
- The decodability and correctability of codes (Q5747691) (← links)
- The divisible code bound revisited (Q5937123) (← links)
- On the classification of extremal even formally self-dual codes of lengths 20 and 22 (Q5939237) (← links)
- On the extendability of linear codes (Q5941626) (← links)
- Linear ternary codes of strongly regular signed graphs (Q6080192) (← links)
- A note on \(t\)-designs in isodual codes (Q6191062) (← links)
- Construction of quasi self-dual codes over a commutative non-unital ring of order 4 (Q6489328) (← links)
