Pages that link to "Item:Q1383603"

The following pages link to Generators and weights of polynomial codes (Q1383603):

Displaying 19 items.

• A method for improving the code rate and error correction capability of a cyclic code (Q361981) (← links)
• Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding (Q660789) (← links)
• On repeated-root multivariable codes over a finite chain ring (Q1009178) (← links)
• A formula for multiple classifiers in data mining based on Brandt semigroups (Q1014262) (← links)
• On weight spaces of polynomial representations of the general linear group as linear codes (Q1331140) (← links)
• Polynomials generating Hamming codes (Q1336018) (← links)
• Weight enumerators of codes derived from polynomial product algorithms (Q1356476) (← links)
• Repeated-root cyclic and negacyclic codes over a finite chain ring (Q2489937) (← links)
• Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (Q2567153) (← links)
• A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code (Q2863727) (← links)
• Cyclic codes through \(B[X]\), \(B[X;\frac{1}{kp} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison (Q2909809) (← links)
• INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES (Q3056434) (← links)
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA (Q3624606) (← links)
• Artinian rings, finite principal ideal rings and algebraic error-correcting codes (Q4260295) (← links)
• An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings (Q4678720) (← links)
• CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}]$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING (Q4903645) (← links)
• OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS (Q5324144) (← links)
• REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA (Q5852040) (← links)
• Internet security applications of the Munn rings (Q5962333) (← links)