scientific article; zbMATH DE number 3147923
From MaRDI portal
Publication:3265111
Cited in
(81)- Algebraic theory of block codes detecting independent errors
- At the dawn of the theory of codes
- A linear-algebra problem from algebraic coding theory
- Some binary BCH codes with length \(n = 2^m + 1\)
- A class of negacyclic BCH codes and its application to quantum codes
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
- Fast parallel decoding of double-error-correcting binary BCH codes
- Roos bound for skew cyclic codes in Hamming and rank metric
- 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
- 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
- On explicit constructions of designs
- Sum-rank product codes and bounds on the minimum distance
- Quantum BCH codes with maximum designed distance
- A practicable timing attack against HQC and its countermeasure
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- A library for formalization of linear error-correcting codes
- 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
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)
- Finding ultrametricity in data using topology
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\)
- Transmission of intra-cellular genetic information: a system proposal
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic 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
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- scientific article; zbMATH DE number 6514313 (Why is no real title available?)
- scientific article; zbMATH DE number 3905842 (Why is no real title available?)
- An odd kind of BCH code
- On some bounds on the minimum distance of cyclic codes over finite fields
- Mutually unbiased weighing matrices
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes
- BCH codes with minimum distance proportional to code length
- Peterson-Gorenstein-Zierler algorithm for skew RS codes
- Feedback linearly extended discrete functions
- 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
- On BCH split metacyclic codes
- BCH cyclic codes
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all _p norms
- Some results on the dimension and Bose distance of the antiprimitive BCH codes
- Parameters of two classes of negacyclic BCH codes
- On the parameters of some LCD BCH codes over \(\mathbb{F}_q\) with length \((q^m+1)/\lambda\)
- A class of BCH codes of length \(\frac{ 2 ( q^{2 m} - 1 )}{ q + 1}\) and their duals
- Parameters of some BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m - 1}{2} \)
- Some results on BCH codes of length \(\frac{q^m + 1}{2} \)
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms
- Algebraic construction and analysis of double-cyclic codes over \(\mathbb{Z}_p\bigoplus u\mathbb{Z}_p\)
- On two conjectures of the duals of AMDS BCH codes
- Constructions of LCD codes from their Schur products
- The weight distributions of three new classes of binary linear codes
- Double cyclic codes over \(\aleph =\bigoplus_{i=0}^n \zeta^i \mathbb{Z}_2\), with \(\zeta^n =0\)
- A class of negacyclic BCH codes and its dual
- Some bounds on the cardinality of the b-symbol weight spectrum of codes
- Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
- Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
- A class of BCH codes with length \(\frac{q^{2m}-1}{q+1}\)
- Quantum CSS duadic and triadic codes: new insights and properties
- On the parameters of a class of narrow sense primitive BCH codes
- A class of BCH codes of length \(n = \frac{q^m -1}{4}\)
- Two classes of q-ary constacyclic BCH codes
- New ternary LCD cyclic and BCH codes
- A class of ternary LCD cyclic codes
- A family of cyclic codes with increasing dimensions and fixed minimum distances
- Fully characterizing lossy catalytic computation
- From worst case to the average: structural guarantees in k-CSP approximation via orthogonal arrays
- A lower bound on the trace norm of Boolean matrices and its applications
- Construction of Hermitian self-dual constacyclic codes with square-root-like lower bounds on the minimum distances
- A class of BCH codes of length \(\frac{q^{2m} - 1}{q^2 + 1}\)
- The exact parameters of a family of BCH codes
- Bit-fixing extractors for almost-logarithmic entropy
- Polynomial-division-based algorithms for computing linear recurrence relations
- On algorithms to find \(p\)-ordering
- A symmetric Roos bound for linear codes
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3265111)