On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings

DOI10.1109/TIT.2013.2264797zbMATH Open1364.94623OpenAlexW1999121964MaRDI QIDQ5346397FDOQ5346397

Authors: Christophe Chabot, Guillaume Quintin, Morgan Barbier 

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)

Cited In (9)

• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
• 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
• Improved single-round secure multiplication using regenerating codes
• Doubly efficient interactive proofs over infinite and non-commutative rings
• Generalized Rational Interpolation Over Commutative Rings and Remainder Decoding
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346397)