Generators and weights of polynomial codes

DOI10.1007/S000130050149zbMath0898.94010OpenAlexW2081884887MaRDI QIDQ1383603

Jilyana Cazaran, Andrei V. Kelarev

Publication date: 3 November 1998

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://eprints.utas.edu.au/185/1/codes1st.pdf

zbMATH Keywords

Hamming weightgeneralized Reed-Muller codespolynomial code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Cyclic codes (94B15)

Related Items (16)

Artinian rings, finite principal ideal rings and algebraic error-correcting codes ⋮ CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON] ⋮ A method for improving the code rate and error correction capability of a cyclic code ⋮ OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS ⋮ Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding] ⋮ CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING] ⋮ Repeated-root cyclic and negacyclic codes over a finite chain ring ⋮ An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings ⋮ INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Internet security applications of the Munn rings ⋮ On repeated-root multivariable codes over a finite chain ring ⋮ A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA ⋮ A formula for multiple classifiers in data mining based on Brandt semigroups ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings ⋮ REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA ⋮ A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code

This page was built for publication: Generators and weights of polynomial codes