The following pages link to Algebraic coding theory (Q2762882):
Displaying 50 items.
- Random Colorings of a Lattice of Squares in the Plane (Q3964587) (← links)
- (Q4002900) (← links)
- Constructive packings of cross polytopes (Q4009233) (← links)
- Groupes de permutations des codes mds affine-invariants (Q4029186) (← links)
- Weight Enumeration and the Geometry of Linear Codes (Q4097305) (← links)
- Computational Complexity of Fourier Transforms Over Finite Fields (Q4140387) (← links)
- Density doubling, double-circulants, and new sphere packings (Q4216320) (← links)
- (Q4231376) (← links)
- (Q4300196) (← links)
- Refined convergents to the associated continued fractions for binary sequences (Q4308502) (← links)
- Primitive Binary Polynomials (Q4404996) (← links)
- Irreducible trinomials over finite fields (Q4417173) (← links)
- (Q4435820) (← links)
- Repeated-root constacyclic codes of arbitrary lengths over the Galois ring GR(p2,m) (Q4554567) (← links)
- On cyclic and negacyclic codes of length 8ℓmpn over finite field (Q4556417) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm (Q4585773) (← links)
- The analog of the Erdös distance problem in finite fields (Q4595070) (← links)
- An analog of the prime number theorem for finite fields via truncated polylogarithm expansions (Q4600713) (← links)
- Some decoding applications of minimal realization (Q4608497) (← links)
- Good codes based on very sparse matrices (Q4608503) (← links)
- Algebraic aspects of B-regular series (Q4630283) (← links)
- On Recognition of Shift Registers (Q4715274) (← links)
- Fast parallel algorithms for polynomial division over an arbitrary field of constants (Q4723298) (← links)
- The reducibility theorem for linearised polynomials over finite fields (Q4731270) (← links)
- Sharply triply transitive projective permutation groups and nonbinary codes generated by them (Q4745751) (← links)
- A parallel Viterbi decoding algorithm (Q4790973) (← links)
- A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397) (← links)
- Stable factorization for Hankel and Hankel‐like matrices (Q4828886) (← links)
- Periods Distribution in the Linear Feedback Generalized Registers (Q4846557) (← links)
- New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent (Q4942791) (← links)
- A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2) (Q5019338) (← links)
- The file distribution problem for processor networks (Q5056091) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- Some results on counting roots of polynomials and the Sylvester resultant (Q5111015) (← links)
- On Cyclic and Negacyclic Codes of Length 8p<sup>s</sup> Over Fp<sup>m</sup> + uFp<sup>m</sup> (Q5140057) (← links)
- BCH Codes with Minimum Distance Proportional to Code Length (Q5150816) (← links)
- ON LIST DECODING OF WAVELET CODES OVER FINITE FIELDS OF CHARACTERISTIC TWO (Q5151266) (← links)
- Generalized cyclotomic numbers and cyclic codes of prime power length over Z4 (Q5193487) (← links)
- Structure of repeated-root constacyclic codes of length 8ℓmpn (Q5223079) (← links)
- Algebraic Coding Theory Over Finite Commutative Rings (Q5272651) (← links)
- On Bivariate Polynomial Factorization over Finite Fields (Q5288235) (← links)
- (Q5316431) (← links)
- Galois Rings and Pseudo-random Sequences (Q5447506) (← links)
- Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences (Q5447518) (← links)
- Randomness and Representation of Span n Sequences (Q5448574) (← links)
- On a Diophantine Equation Related to Perfect Codes (Q5625058) (← links)
- Factoring Polynomials Over Large Finite Fields (Q5659665) (← links)
- Sphere packings constructed from BCH and Justesen codes (Q5665244) (← links)
- Une famille infinie de formes quadratiques entières; leurs groupes d'automorphismes (Q5676393) (← links)
