scientific article
From MaRDI portal
Publication:3265111
zbMath0090.34608MaRDI QIDQ3265111
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Finding ultrametricity in data using topology, On explicit constructions of designs, Polynomial-division-based algorithms for computing linear recurrence relations, Sum-rank product codes and bounds on the minimum distance, On algorithms to find \(p\)-ordering, Some binary BCH codes with length \(n = 2^m + 1\), Quantum BCH codes with maximum designed distance, A symmetric Roos bound for linear codes, A practicable timing attack against HQC and its countermeasure, Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\), BCH codes and distance multi- or fractional colorings in hypercubes asymptotically, A class of negacyclic BCH codes and its application to quantum codes, On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\), An odd kind of BCH code, Algebraic theory of block codes detecting independent errors, Transmission of intra-cellular genetic information: a system proposal, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, Dimensions of nonbinary antiprimitive BCH codes and some conjectures, Two families of negacyclic BCH codes, Connections between the extreme points for Vandermonde determinants and minimizing risk measure in financial mathematics, Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance, On BCH split metacyclic codes, BCH cyclic codes, A library for formalization of linear error-correcting codes, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions, BCH Codes with Minimum Distance Proportional to Code Length, On some bounds on the minimum distance of cyclic codes over finite fields, Mutually unbiased weighing matrices, Five families of the narrow-sense primitive BCH codes over finite fields, A non-cyclic triple-error-correcting BCH-like code and some minimum distance results, Roos bound for skew cyclic codes in Hamming and rank metric, At the dawn of the theory of codes, On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \), M-theory cosmology, octonions, error correcting codes, New bounds on the minimum distance of cyclic codes, Peterson–Gorenstein–Zierler algorithm for skew RS codes, A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \), A linear-algebra problem from algebraic coding theory, Fast parallel decoding of double-error-correcting binary BCH codes, Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes, On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)], Guessing Gröbner bases of structured ideals of relations of sequences, Simplified High-Speed High-Distance List Decoding for Alternant Codes, A survey of constructive coding theory, and a table of binary codes of highest known rate, Decoding of repeated-root cyclic codes up to new bounds on their minimum distance, Feedback linearly extended discrete functions
