scientific article

Publication date: 1979

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

association scheme Hadamard matrices weight distribution nonlinear codes perfect codes Reed-Solomon codes self-dual codes Reed-Muller code Golay code dual code BCH code Goppa code minimal distance quadratic residue code Srivastava code Preparata code Justesen codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Polynomials over finite fields (11T06) Cyclic codes (94B15) Theory of error-correcting codes and error-detecting codes (94Bxx)

Related Items (47)

On the symmetry group of the Mollard code ⋮ On perfect codes that do not contain Preparata-like codes ⋮ On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code ⋮ A geometric approach to finding new lower bounds of \(A(n,d,w)\) ⋮ On the number of edges in induced subgraphs of a special distance graph ⋮ Independence numbers of random subgraphs of distance graphs ⋮ A Lloyd theorem in weakly metric association schemes ⋮ On the structure of symmetry groups of Vasil'ev codes ⋮ Interrelation of the cyclic and weight structure of codes over \(\text{GF}(q)\) and proportionality classes ⋮ Cryptographic properties of a new national encryption standard of Ukraine ⋮ On the equivalence of certain constant weight codes and combinatorial designs ⋮ The combinatorics of binary arrays ⋮ A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases ⋮ ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On spectra of linear codes ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Metric complements to subspaces in the Boolean cube ⋮ On codes with distances \(d\) and \(n\) ⋮ Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities ⋮ On the construction of transitive codes ⋮ On cosets of weight 4 of binary BCH codes with minimum distance 8 and exponential sums ⋮ On DNA codes ⋮ Geometric WOM codes and coding strategies for multilevel flash memories ⋮ A [45,13 code with minimal distance 16] ⋮ The automorphism group of an [18,9,8 quaternary code] ⋮ Application of a fast simulation method to the estimation of the number of some \(k\)-dimensional subspaces over a finite space ⋮ Formation of pseudorandom sequences with improved autocorrelation properties ⋮ COMPARISON OF THE BINARY GOLAY CODE WITH THE ALGEBRO-GEOMETRIC CODE ⋮ Upper and lower estimates for the number of some \(k\)-dimensional subspaces of a given weight over a finite field ⋮ Nonlinear \(q\)-ary codes with large code distance ⋮ Propelinear codes related to some classes of optimal codes ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ On the de Bruijn torus problem ⋮ Bounds and constructions of asymmetric or unidirectional error-correcting codes ⋮ Distance graphs with large chromatic numbers and small clique numbers ⋮ MDS codes in Doob graphs ⋮ On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes ⋮ A probabilistic scheme of independent random elements distributed over a finite lattice. II: The method of lattice moments ⋮ Combinatorics associated with inflections and bitangents of plane quartics ⋮ Classification of Steiner quadruple systems of order 16 and rank at most 13 ⋮ On the error-detecting performance of some classes of block codes ⋮ Test case generators and computational results for the maximum clique problem ⋮ The maximum clique problem

This page was built for publication: