On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings

DOI10.1109/TIT.2013.2264797zbMath1364.94623OpenAlexW1999121964MaRDI QIDQ5346397

Christophe Chabot, Morgan Barbier, Guillaume Quintin

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2013.2264797

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (6)

Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)] ⋮ Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃 〈u2〉] ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings

This page was built for publication: On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings