The following pages link to Algebraic coding theory (Q2762882):
Displaying 19 items.
- Decoding algorithm as a moment problem related to the extended Lotka–Volterra system (Q5870387) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
- Linear cellular automata and recurring sequences in finite fields (Q5903958) (← links)
- On subspaces contained in subsets of finite homogeneous spaces (Q5906212) (← links)
- Linear cellular automata and recurring sequences in finite fields (Q5966489) (← links)
- On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
- An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem (Q6091766) (← links)
- Two families of negacyclic BCH codes (Q6101271) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)
- Quantum and LCD codes from skew constacyclic codes over a finite non-chain ring (Q6159258) (← links)
- Repeated-root constacyclic codes of length \(6l^mp^n\) (Q6163792) (← links)
- On restricted partitions of numbers (Q6166082) (← links)
- Characterization of irreducible polynomials over a special principal ideal ring (Q6178036) (← links)
- Minimum vertex cover, distributed decision-making, and communication complexity (Q6184364) (← links)
- Linear codes invariant under cyclic endomorphisms (Q6580194) (← links)
- Equal-degree factorization of binomials and trinomials over finite fields (Q6584731) (← links)
- Quantum and LCD codes from skew constacyclic codes over a general class of non-chain rings (Q6588841) (← links)
- On isometry and equivalence of skew constacyclic codes (Q6635120) (← links)
- Repeated-root constacyclic codes of length \(k^s l^m p^n\) over finite fields (Q6655761) (← links)
