Results 81 to 90 of about 5,913 (208)
Algorithm of hybrid decoding of Reed–Solomon codes without recurrent procedures
Технологія та конструювання в електронній апаратурі, 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
Code Constructions based on Reed-Solomon Codes
CoRR, 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
List Decoding of Generalized Reed-Solomon Codes by Using a Modified Extended Key Equation Algorithm
EURASIP 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
A New Lower Bound for Permutation Codes Using Reed–Solomon Codes
IEEE AccessWe 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
High-Performance SIMD Software for Spielman Codes in Zero-Knowledge Proofs
Transactions on Cryptographic Hardware and Embedded SystemsWe 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
Trace-shortened Reed-Solomon codes
, 1994 Reed-Solomon (RS) codes have been part of standard NASA telecommunications systems for many years. RS codes are character-oriented error-correcting codes, and their principal use in space applications has been as outer codes in concatenated coding ...
Mceliece, R. J., Solomon, G.
core +1 more source
Duals of linearized Reed-Solomon codes
, 2021 We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of linearized Reed-
CARUSO, Xavier, DURAND, Amaury
core
ON THE PROGRAM MODULE REALIZATION OF SUDAN DETERMINED DECODER FOR REED-SOLOMON CODES
Вестник Донского государственного технического университета, 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
The Dimension of Subcode-Subfields of Shortened Generalized Reed Solomon Codes
, 2011 Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length.
Marshall, Kyle +2 more
core +2 more sources
ON THE PROGRAM MODULE REALIZATION OF SUDAN DETERMINED DECODER FOR REED-SOLOMON CODES
Advanced 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