scientific article; zbMATH DE number 1250549

Publication date: 14 February 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

BCH codes Reed-Muller codes bounds perfect codes algebraic geometry codes Goppa codes Reed-Solomon codes Krawtchouk polynomials cyclic codes block codes convolutional codes Shannon theorem Lee metric linear programming bound arithmetic codes uniformly packed codes Van Lint-Wilson bound quadratic Kerdock codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Cyclic codes (94B15) Sampling theory in information and communication theory (94A20) Arithmetic codes (94B40) Convolutional codes (94B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of error-correcting codes and error-detecting codes (94Bxx)

Related Items

A characterization of MDS codes that have an error correcting pair, Character sums and MacWilliams identities, Slight improvements of the Singleton bound, Correlations between the ranks of submatrices and weights of random codes, A projective two-weight code related to the simple group $\mathrm{Co}_1$ of Conway, Induced weights on quotient modules and an application to error correction in coherent networks, Computing normalisers of intransitive groups, The union-closed sets conjecture almost holds for almost all random bipartite graphs, MacWilliams-type identities for fragment and sphere enumerators, A bound on Grassmannian codes, On the integrality of $n$th roots of generating functions, Duality of codes supported on regular lattices, with an application to enumerative combinatorics, Computing discrete logarithms using $\mathcal{O}((\log q)^2)$ operations from $\{+,-,\times,\div,\&\}$, Local expanders, Smoothed analysis of complex conic condition numbers, Subgroup regular sets in Cayley graphs, Blocked regular fractional factorial designs with minimum aberration, Erdős-Burgess constant in commutative rings, The spectra of subKautz and cyclic Kautz digraphs, Decoding turbo-like codes via linear programming, Colorings of the $d$-regular infinite tree, Hadamard tensors and lower bounds on multiparty communication complexity, On Bonisoli's theorem and the block codes of Steiner triple systems, Infinite families of 3-designs from a type of five-weight code, A class of binary cyclic codes with optimal parameters, Hierarchical Models, Marginal Polytopes, and Linear Codes, Further examples of maximal curves which cannot be covered by the Hermitian curve, New short coverings of $\mathbb{F}_q^3$ from pairwise weakly linearly independent sets, A new class of distance-optimal binary cyclic codes and their duals, A class of optimal ternary cyclic codes and their duals, New quantum codes from constacyclic codes over a non-chain ring, A Stronger Bound for the Strong Chromatic Index, Expander graphs and their applications, Vectorial resilient $\mathrm{PC}(l)$ of order $k$ Boolean functions from AG-codes, On doubly-cyclic convolutional codes, Isometric embeddings of finite fields, Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes, Linear codes using skew polynomials with automorphisms and derivations, Affine Cartesian codes, Algebraic geometric codes with applications, Unnamed Item, Traceability codes, Integer invariants of abelian Cayley graphs, Bessel sequences of exponentials on fractal measures, The linear span of the frequency hopping sequences in optimal sets, On codes from hypergraphs., The diameter of cyclic Kautz digraphs, Linked systems of symmetric designs, Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields, Solving a fixed number of equations over finite groups, Asymptotic analysis on the normalized $k$-error linear complexity of binary sequences, The minimal $k$-dispersion of point sets in high dimensions, On Zeros of a Polynomial in a Finite Grid, A MacWilliams type identity for matroids, Codes correcting restricted errors, Extending Swerdlow's hypothesis: statistical models of mitochondrial deterioration and aging, On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics, On coset leader graphs of structured linear codes, 1-generator generalized quasi-cyclic codes over $\mathbb {Z}_{4}$, On a conjecture regarding identification in Hamming graphs, Infinite families of 2-designs and 3-designs from linear codes, Minimum aberration blocking schemes for two- and three-level fractional factorial designs, Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes, On the structure of linear recurrent error-control codes, Descriptional Complexity of Error Detection, On polynomials $x^n-1$ over binary fields whose irreducible factors are binomials and trinomials, Random weighting, asymptotic counting, and inverse isoperimetry, Nonlinear diffusion layers, Linear error-block codes, MacWilliams type identities on the Lee and Euclidean weights for linear codes over $\mathbb{Z}_\ell$, Combinatorial $t$-designs from special functions, A family of optimal ternary cyclic codes from the Niho-type exponent, Sets of complex unit vectors with few inner products and distance-regular graphs, New identities relating wild Goppa codes, On the $\ell_4:\ell_2$ ratio of functions with restricted Fourier support, Linear programming bounds for codes via a covering argument, Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes, Weighted counting of solutions to sparse systems of equations, Non-uniform packings, Imprimitive distance-transitive graphs with primitive core of diameter at least 3, Typically-correct derandomization for small time and space, Hadamard matrices and doubly even self-dual error-correcting codes, On the maximality of linear codes, The Hamming distances of repeated-root cyclic codes of length $5 p^s$, Monomial-Cartesian codes and their duals, with applications to LCD codes, quantum codes, and locally recoverable codes, Binary codes from Paley graphs of prime-power-square order, Testing algebraic geometric codes, On the weight distribution of convolutional codes, Some (almost) optimally extendable linear codes, Monotone maps, sphericity and bounded second eigenvalue, On mean values of the $L_q$-discrepancies of point distributions, Generalized minimum aberration for asymmetrical fractional factorial designs, Generalized minimum aberration for asymmetrical fractional factorial designs., The enumerability of P collapses P to NC, Graphs, friends and acquaintances, Fourier-reflexive partitions and MacWilliams identities for additive codes, Constructing Partial MDS Codes from Reducible Algebraic Curves, Heuristic decoding of linear codes using commutative algebra, Doubly-Periodic Sequences and Two-Dimensional Recurrences, PAC-learning gains of Turing machines over circuits and neural networks, One more proof of the first linear programming bound for binary codes and two conjectures, Linear ternary codes of strongly regular signed graphs, An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem, New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes, Steiner systems $S(2,4, 2^m)$ supported by a family of extended cyclic codes, Balanced non-adjacent forms, Experiments with holographic associative memory, Private information retrieval schemes using cyclic codes, Implicit representation of relations, Zero testing and equation solving for sparse polynomials on rectangular domains, Saturated Subgraphs of the Hypercube, Unnamed Item, Minimality and other properties of the width-𝑤 nonadjacent form, Packing the hypercube, Parameters of 2-Designs from Some BCH Codes, Weight enumerators of Reed-Muller codes from cubic curves and their duals, Decoding algorithm as a moment problem related to the extended Lotka–Volterra system, Reed-Muller Codes