scientific article; zbMATH DE number 1209696
From MaRDI portal
Publication:4212172
zbMath0928.94008MaRDI QIDQ4212172
Publication date: 13 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BCH codesGriesmer boundnonlinear codesdesignscyclic codesgamesalgebraic coding theorygreedy codes\(Z_4\) codesresidual codesGray imagesQR codes
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items (49)
Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ A result on the weight distributions of binary quadratic residue codes ⋮ Self-reciprocal polynomials and coterm polynomials ⋮ Siegel modular forms of weight 13 and the Leech lattice ⋮ On the MacWilliams identities for linear codes ⋮ On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2\) codes] ⋮ On the minimum weights of binary linear complementary dual codes ⋮ Primitive idempotent tables of cyclic and constacyclic codes ⋮ Algebraic geometric codes on anticanonical surfaces ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Mutually disjoint \(t\)-designs and \(t\)-SEEDs from extremal doubly-even self-dual codes ⋮ Linear ternary codes of strongly regular signed graphs ⋮ In memoriam. A tribute to Vera Pless (1931--2020) ⋮ Configurations of extremal type II codes via harmonic weight enumerators ⋮ A note on \(t\)-designs in isodual codes ⋮ Some cyclic codes of length \(2p^n\) ⋮ Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities ⋮ Neighbour transitivity on codes in Hamming graphs ⋮ Unnamed Item ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Designs and self-dual codes with long shadows. ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ Zeta functions for formal weight enumerators and the extremal property ⋮ On the number of alternating paths in random graphs ⋮ Dense packings from quadratic fields and codes ⋮ BCH Codes with Minimum Distance Proportional to Code Length ⋮ \(5\)-SEEDs from the lifted Golay code of length \(24\) over \(\mathbb{Z}_4\) ⋮ Linear codes resulting from finite group actions ⋮ Mutually Disjoint 5‐Designs and 5‐Spontaneous Emission Error Designs from Extremal Ternary Self‐Dual Codes ⋮ The divisible code bound revisited ⋮ Visualizing Vandermonde's determinant through nonintersecting lattice paths ⋮ On the classification of extremal even formally self-dual codes of lengths 20 and 22 ⋮ On the extendability of linear codes ⋮ On the number of alternating paths in bipartite complete graphs ⋮ The decodability and correctability of codes ⋮ Minimal cyclic codes of length \(p^nq\) ⋮ Primitive idempotents of cyclic codes of length \(p\) and 2\(p\) ⋮ Cyclic sieving for cyclic codes ⋮ An abundance of invariant polynomials satisfying the Riemann hypothesis ⋮ Topological spaces via phenotype–genotype spaces ⋮ A STUDY ON EQUIVALENCE OF 1-ERROR CORRECTING [6, 2, 4 QUATERNARY CODES] ⋮ Lattices of quasi-cyclic codes ⋮ Extremal invariant polynomials not satisfying the Riemann hypothesis ⋮ Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis ⋮ Cyclotomic numbers and primitive idempotents in the ring \(\mathrm{GF}(q)[x/(x^{p^n} - 1)\)] ⋮ Configurations: A case study in mathematical beauty ⋮ Minimal cyclic codes of length \(8p^n\) over \(\mathrm{GF}(q)\), where \(q\) is prime power of the form \(8k+5\) ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
This page was built for publication:
