Results 181 to 190 of about 350,847 (217)

Reed-Solomon-Codes

2003
Die Reed-Solomon-Codes (RS-Codes) sind eine besonders wichtige Klasse von linearen Codes, die haufig in der Praxis benutzt werden. Thematisch gehoren sie eigentlich als eine spezielle Form der BCH-Codes in Kapitel 3. Wegen ihrer grosen praktischen Bedeutung wollen wir ihnen jedoch ein eigenes Kapitel widmen.
openaire   +2 more sources

MDS and Near-MDS Codes via Twisted Reed–Solomon Codes

Designs, Codes, and Cryptography, 2022
Junzhen Sui, Xiaomeng Zhu
exaly  

Twisted Reed–Solomon Codes With One-Dimensional Hull

IEEE Communications Letters, 2021
Wu Yansheng
exaly  

Entanglement-Assisted Reed–Solomon Codes Over Qudits: Theory and Architecture

Quantum Information Processing, 2021
Priya J Nadkarni, Shayan Srinivasa Garani   +1 more
exaly  

Construction of MDS Twisted Reed–Solomon Codes and LCD MDS Codes

Designs, Codes, and Cryptography, 2021
Shengwei Liu, Hongwei Liu
exaly  

MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes

IEEE Transactions on Information Theory, 2022
Xia Li, Qin Yue, Junzhen Sui
exaly  

Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols

IEEE Transactions on Computers, 2020
Yunghsiang S Han, Sian-Jheng Lin, Leilei Yu   +2 more
exaly  

On Generalized Reed-Solomon Codes

IEEE Transactions on Communications
Xiangping Zheng, Xiao Ma 0001
openaire   +2 more sources

Deep Holes and MDS Extensions of Reed–Solomon Codes

IEEE Transactions on Information Theory, 2017
Krishna Kaipa
exaly  

Succinct Verification Through Reed-Solomon and Folded Reed-Solomon Codes

The overarching problem for our thesis talks is succinct verification: how can one check that a computation (e.g. $2^{10} = 1024$) has been performed correctly? A natural way to verify is to repeat the claimed computation from scratch and check that the results agree.
openaire   +1 more source