Results 91 to 100 of about 868,467 (209)

Code Constructions based on Reed-Solomon Codes

open access: yesCoRR, 2017
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which yields codes with lengths of factors of the field size.
Michael Schelling, Martin Bossert
openaire   +2 more sources

Codes de Reed-Solomon [PDF]

open access: yes
Grande efficacité des codes de Reed-Solomon pour la transmission d’informationsNON ...
Barras, Benjamin
core   +1 more source

Algorithm of hybrid decoding of Reed–Solomon codes without recurrent procedures

open access: yesТехнологія та конструювання в електронній апаратурі, 2005
A method of decoding Reed–Solomon codes is considered, based on non-recurrent procedures for calculating special extensions of Hankel (Toeplitz) matrices and syndromes. The method makes it possible to significantly reduce error probability during channel
I. V. Ivanova
doaj  

List Decoding of Generalized Reed-Solomon Codes by Using a Modified Extended Key Equation Algorithm

open access: yesEURASIP Journal on Wireless Communications and Networking, 2011
This work presents a modified extended key equation algorithm in list decoding of generalized Reed-Solomon (GRS) codes. A list decoding algorithm of generalized Reed-Solomon codes has two steps, interpolation and factorization. The extended key equation
Chang Ming-Hua, Hu Ta-Hsiang
doaj  

High-Performance SIMD Software for Spielman Codes in Zero-Knowledge Proofs

open access: yesTransactions on Cryptographic Hardware and Embedded Systems
We present the first high-performance SIMD software implementation of Spielman codes for their use in polynomial commitment schemes and zero-knowledge proofs.
Florian Krieger   +3 more
doaj   +1 more source

A New Lower Bound for Permutation Codes Using Reed–Solomon Codes

open access: yesIEEE Access
We present a constructive lower bound for permutation codes under Kendall’s $\tau $ -metric that improves upon the classical Gilbert-Varshamov estimate for many parameters.
Rana T. Shwayyea   +3 more
doaj   +1 more source

ON THE PROGRAM MODULE REALIZATION OF SUDAN DETERMINED DECODER FOR REED-SOLOMON CODES

open access: yesВестник Донского государственного технического университета, 2018
The program module of Sudan determined list decoder for Reed-Solomon codes is developed. The block diagram and program realization of decoder are constructed. A part of the realization is based on the effective factorization algorithm of Roth-Ruckenstein.
V.V. MKRTICHAN
doaj  

ON THE PROGRAM MODULE REALIZATION OF SUDAN DETERMINED DECODER FOR REED-SOLOMON CODES

open access: yesAdvanced Engineering Research, 2007
The program module of Sudan determined list decoder for Reed-Solomon codes is developed. The block diagram and program realization of decoder are constructed. A part of the realization is based on the effective factorization algorithm of Roth-Ruckenstein.
V.V. MKRTICHAN
doaj  

Analysis of syndrome decoding methods for Reed–Solomon codes

open access: yesТехнологія та конструювання в електронній апаратурі, 2005
Methods of syndrome decoding are considered. The possibility of various approaches to decoding Reed–Solomon codes is shown. It is concluded that the development of non-recursive decoding procedures is necessary, which can be achieved through the use of ...
I. V. Ivanova
doaj  

A Reed-Solomon Coded DS-CDMA System Using Noncoherent M-ary Orthogonal Modulation over Multipath Fading Channels

open access: yes, 2000
The performance of Reed–Solomon (RS) coded direct-sequence code division multiple-access (DS-CDMA) systems using noncoherent M-ary orthogonal modulation is investigated over multipath Rayleigh fading channels.
Yang, L-L., Hanzo, L., Yen, K.
core   +1 more source

Home - About - Disclaimer - Privacy