scientific article
From MaRDI portal
zbMath0485.94015MaRDI QIDQ3946078
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BCH codesReed-Muller codesboundsperfect codesGoppa codesReed-Solomon codesKrawtchouk polynomialsmotivationquadratic residue codeslinear programming boundShannon's theoremGolay codesuniformly packed codesblock-codesJustesen codes
Linear codes (general theory) (94B05) Cyclic codes (94B15) Arithmetic codes (94B40) Convolutional codes (94B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items
A construction of combinatorial NLTS, Weight distributions of geometric Goppa codes, More efficient PAC-learning of DNF with membership queries under the uniform distribution, Multidimensional stochastic matrices and error-correcting codes, Minimum aberration majorization in non-isomorphic saturated designs, Random walks and orthogonal functions associated with highly symmetric graphs, A Lloyd theorem in weakly metric association schemes, Applications of balance equations to vertex switching reconstruction, Bent functions and random Boolean formulas, The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes], Unnamed Item, Structure and performance of generalized quasi-cyclic codes, Star factorizations of graph products, Ideal representation of Reed-Solomon and Reed-Muller codes, Unnamed Item, On deep holes of standard Reed-Solomon codes, Two classes of cyclic extended double-error-correcting Goppa codes, The Football Pool Polytope, Defects of codes from higher dimensional algebraic varieties, Permutation polynomials over finite fields, Weierstrass semigroup and codes over the curve \(y^q + y = x^{q^r + 1}\), On the automatizability of polynomial calculus, On membership comparable sets, A tropical approach to secant dimensions, A note onm-weights of linear codes, Smoothness versus skewness in block designs with an application to tournaments, Factoring polynomials over finite fields: A survey, The ideal entropy of BCI-algebras and its application in the binary linear codes, Algebraic complexities and algebraic curves over finite fields, General constructions for information-theoretic private information retrieval, What is known about unit cubes, Onk-spaces of real matrices, Sharpening the Gilbert-Varshamov bound in the finite case, Local Subgroups of the Monster and Odd Code Loops, Ternary trades and their codes, A connection between coding theory and polarized partition relations, An improvement of the Feng-Rao bound on minimum distance, Self-dual extended cyclic codes, Ulam's searching game with three lies, Indistinguishable Sceneries on the Boolean Hypercube, The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes, On equidistant constant weight codes, A STUDY ON EQUIVALENCE OF 1-ERROR CORRECTING [6, 2, 4 QUATERNARY CODES], On weights in duadic codes, Q-codes, Prime cyclic arithmetic codes and the distribution of power residues, A survey of constructive coding theory, and a table of binary codes of highest known rate, Nearly perfect binary codes, Weight congruence for p-ary cyclic codes, Bounds on \((n,r)\)-arcs and their application to linear codes, The highly connected matroids in minor-closed classes, Boolean ideals and their varieties, Codes, graphs, and schemes from nonlinear functions, Error thresholds in a mutation-selection model with Hopfield-type fitness, A survey of partial difference sets, Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes, Weight distributions of linear codes and the Gleason-Pierce theorem, On \((p,1)\)-subnormal \(q\)-ary covering codes, Cyclic projective planes and binary, extended cyclic self-dual codes, Lattices with theta functions for G(\(\sqrt{2})\) and linear codes, Binary search with errors and variable cost queries, A note on the decoding complexity of error-correcting codes, Quadratic-residue codes and cyclotomic fields, A note on the computation of the bit error rate for binary block codes, Quasi-symmetric designs and self-dual codes, Eigenvalues, eigenspaces and distances to subsets, Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture, A characterization of designs related to dodecads in the Witt system S(5,8,24), Jack van Lint (1932--2004): a survey of his scientific work, Decoding of Reed Solomon codes beyond the error-correction bound, Self-dual Goppa codes, An application of difference sets to a problem concerning graphical codes, Tight approximations for resource constrained scheduling and bin packing, On the structure of Hermitian codes, Which extended Goppa codes are cyclic?, On the Delsarte inequalities, On self-dual, doubly even codes of length 32, Fast correlation attacks on certain stream ciphers, Weierstrass semigroup and pure gaps at several points on the \(GK\) curve, Affine blocking sets, three-dimensional codes and the Griesmer bound, Improved constructions for non-adaptive threshold group testing, A simple combinatorial treatment of constructions and threshold gaps of ramp schemes, On the covering radius of an unrestricted code as a function of the rate and dual distance, Univariate polynomial factorization over finite fields, Error linear complexity measures for multisequences, Quadratic residue codes and symplectic groups, Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets, Planes of order 10 do not have a collineation of order 5, Complete solving of explicit evaluation of Gauss sums in the index 2 case, Inhomogeneous quantum codes. I: Additive case, Linear tree codes and the problem of explicit constructions, On automorphisms of geometric Goppa codes, Perfect codes with distinct protective radii, Completely regular codes and completely transitive codes, Codes and designs, Switching reconstruction and diophantine equations, Weight enumerators of reducible cyclic codes and their dual codes, Extremal doubly-even codes of length 64 derived from symmetric designs, The minimum weight of the Grassmann codes C(k,n), On the exact evaluation of certain instances of the Potts partition function by quantum computers, On the parameters of codes for the Lee and modular distance, A note on edge-based graph partitioning and its linear algebraic structure, Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes, Linear sections of the general linear group: A geometric approach, A combinatorial problem for vector spaces over finite fields, Explicit factorization of \(x^n-1\in \mathbb {F}_q[x\)], The primitive idempotents and weight distributions of irreducible constacyclic codes, Codes based on complete graphs, Quadratic residue codes in their prime, A note on matrix rigidity, A lower bound for the multiplication of polynomials modulo a polynomial, A general case of formal duality between binary nonlinear codes, An optimal polynomial for a covering radius problem, Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\), Local search in coding theory, On the Reed-Muller codes, On the covering radius of Reed-Muller codes, Binomial coefficient codes over GF(2), On perfect arithmetic codes, Linear codes with complementary duals, Completely regular codes, Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes, On the cardinality of sets of sequences with given maximum correlation, Greedy codes, Tight embeddings of partial quadrilateral packings, Super-visible codes, On identifying codes in binary Hamming spaces, An algebraic closure for barycentric algebras and convex sets, Weight enumerators of self-orthogonal codes, Contractions of self-orthogonal codes, The regular two-graph on 276 vertices, Embedding edge-colored complete graphs in binary affine spaces, Chinese remainder codes, The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\), Minimal codes in Abelian group algebras, A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound], Periodic multisequences with large error linear complexity, Some results on the differential functions over finite fields, Combinatorial polarization, Strong nondeterministic Turing reduction - a technique for proving intractability, Sparse hard sets for P: Resolution of a conjecture of Hartmanis, Commutative association schemes, Resolution of Hartmanis' conjecture for NL-hard sparse sets, Local weight enumerators for binary self-dual codes, Symmetric flows and broadcasting in hypercubes, On the asymptotic behaviour of Lee-codes, Information sets in quadratic-residue codes, A characterization of designs related to the Witt system S(5,8,24), Uniformly packed codes and more distance regular graphs from crooked functions, The condition for a cyclic code to have a complementary dual, Covering radius and dual distance, Construction techniques for some thin sets in duals of compact abelian groups, On character sums and codes
