Pages that link to "Item:Q3289412"
From MaRDI portal
The following pages link to On a class of error correcting binary group codes (Q3289412):
Displaying 50 items.
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877) (← links)
- New developments in \(q\)-polynomial codes (Q267804) (← links)
- An odd kind of BCH code (Q385149) (← links)
- Efficient prediction algorithms for binary decomposition techniques (Q408680) (← links)
- Efficient implementation of class-based decomposition schemes for naïve Bayes (Q479479) (← links)
- On some bounds on the minimum distance of cyclic codes over finite fields (Q498967) (← links)
- Mutually unbiased weighing matrices (Q498976) (← links)
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions (Q661978) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- A symmetric Roos bound for linear codes (Q855868) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- At the dawn of the theory of codes (Q1209799) (← links)
- A linear-algebra problem from algebraic coding theory (Q1259645) (← links)
- Some binary BCH codes with length \(n = 2^m + 1\) (Q1633286) (← links)
- A class of negacyclic BCH codes and its application to quantum codes (Q1671629) (← links)
- Algebraic quantum synchronizable codes (Q1677143) (← links)
- Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance (Q1696750) (← links)
- A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
- Fast parallel decoding of double-error-correcting binary BCH codes (Q1808569) (← links)
- The packing problem for projective geometries over GF(3) with dimension greater than five (Q1839443) (← links)
- Roos bound for skew cyclic codes in Hamming and rank metric (Q1995207) (← links)
- On some cyclic codes of length \(\frac{q^{2m} - 1}{q + 1} \) (Q2007712) (← links)
- M-theory cosmology, octonions, error correcting codes (Q2024303) (← links)
- New bounds on the minimum distance of cyclic codes (Q2025340) (← links)
- On the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x]\) to \(\mathbb{F}_q [x]\) (Q2066396) (← links)
- Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
- On explicit constructions of designs (Q2121799) (← links)
- Sum-rank product codes and bounds on the minimum distance (Q2123308) (← links)
- Quantum BCH codes with maximum designed distance (Q2140831) (← links)
- A practicable timing attack against HQC and its countermeasure (Q2158241) (← links)
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\) (Q2174953) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- A library for formalization of linear error-correcting codes (Q2209551) (← links)
- Five families of the narrow-sense primitive BCH codes over finite fields (Q2243889) (← links)
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results (Q2248644) (← links)
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) (Q2291669) (← links)
- Finding ultrametricity in data using topology (Q2359575) (← links)
- Dimensions of three types of BCH codes over \(\mathrm{GF}(q)\) (Q2397534) (← links)
- Constructing error-correcting binary codes using transitive permutation groups (Q2410250) (← links)
- Transmission of intra-cellular genetic information: a system proposal (Q2415671) (← links)
- Cyclic codes from cyclotomic sequences of order four (Q2447744) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- A coding scheme that increases the code rate (Q2514072) (← links)
- Orthogonal and partially balanced arrays and their application in design of experiments (Q2627069) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1} (Q3104686) (← links)
- Generic error control coding modules (Q3495169) (← links)
