scientific article

From MaRDI portal
Revision as of 10:58, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3265111

zbMath0090.34608MaRDI QIDQ3265111

A. Hocquenghem

Publication date: 1959


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



Related Items (47)

Finding ultrametricity in data using topologyOn explicit constructions of designsPolynomial-division-based algorithms for computing linear recurrence relationsSum-rank product codes and bounds on the minimum distanceOn algorithms to find \(p\)-orderingSome binary BCH codes with length \(n = 2^m + 1\)Quantum BCH codes with maximum designed distanceA symmetric Roos bound for linear codesA practicable timing attack against HQC and its countermeasureDimensions of three types of BCH codes over \(\mathrm{GF}(q)\)BCH codes and distance multi- or fractional colorings in hypercubes asymptoticallyA class of negacyclic BCH codes and its application to quantum codesOn generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)An odd kind of BCH codeAlgebraic theory of block codes detecting independent errorsTransmission of intra-cellular genetic information: a system proposalIn-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variantsDimensions of nonbinary antiprimitive BCH codes and some conjecturesTwo families of negacyclic BCH codesConnections between the extreme points for Vandermonde determinants and minimizing risk measure in financial mathematicsHartmann-Tzeng bound and skew cyclic codes of designed Hamming distanceOn BCH split metacyclic codesBCH cyclic codesA library for formalization of linear error-correcting codesA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codesA triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functionsBCH Codes with Minimum Distance Proportional to Code LengthOn some bounds on the minimum distance of cyclic codes over finite fieldsMutually unbiased weighing matricesFive families of the narrow-sense primitive BCH codes over finite fieldsA non-cyclic triple-error-correcting BCH-like code and some minimum distance resultsRoos bound for skew cyclic codes in Hamming and rank metricAt the dawn of the theory of codesOn some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \)M-theory cosmology, octonions, error correcting codesNew bounds on the minimum distance of cyclic codesPeterson–Gorenstein–Zierler algorithm for skew RS codesA class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)A linear-algebra problem from algebraic coding theoryFast parallel decoding of double-error-correcting binary BCH codesImproved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting CodesOn 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 sequencesSimplified High-Speed High-Distance List Decoding for Alternant CodesA survey of constructive coding theory, and a table of binary codes of highest known rateDecoding of repeated-root cyclic codes up to new bounds on their minimum distanceFeedback linearly extended discrete functions






This page was built for publication: