On the key equation over a commutative ring

DOI10.1023/A:1008385407717zbMath1004.94029MaRDI QIDQ1580538

Ana Sălăgean, Graham H. Norton

Publication date: 25 January 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

domainsBCH codesdecodinglocal ringsminimal polynomialalternant codeserror correcting codescommutative ringskey equationerror locator polynomialgeneralized Reed-Solomon codes over finite ringssyndrome sequence

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35) Arithmetic codes (94B40)

Related Items (6)

A transform approach to polycyclic and serial codes over rings ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ On the structure of repeated-root polycyclic codes over local rings ⋮ On MDS convolutional codes over \(\mathbb{Z}_{p^r}\) ⋮ Gröbner bases over Galois rings with an application to decoding alternant codes ⋮ Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.

This page was built for publication: On the key equation over a commutative ring