Results 71 to 80 of about 33,465 (136)
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
Some results on ordinary words of standard Reed-Solomon codes
AIMS Mathematics, 2019 The Reed-Solomon codes are widely used to establish a reliable channel to transmit information in digital communication which has a strong error correction capability and a variety of efficient decoding algorithm.We usually use the maximum likelihood ...
Xiaofan Xu, Yongchao Xu, Shaofang Hong
doaj +1 more source
Analysis of Blind Reconstruction of BCH Codes
Entropy, 2020 In this paper, the theoretical lower-bound on the success probability of blind reconstruction of Bose–Chaudhuri–Hocquenghem (BCH) codes is derived. In particular, the blind reconstruction method of BCH codes based on the consecutive roots of generator ...
Soonhee Kwon, Dong-Joon Shin
doaj +1 more source
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
Algebraic List-decoding of Subspace Codes [PDF]
, 2012 Subspace codes were introduced in order to correct errors and erasures for randomized network coding, in the case where network topology is unknown (the noncoherent case).
Mahdavifar, Hessam, Vardy, Alexander
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
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
Dimensions of the hull of generalized Reed-Solomon codes
AIMS MathematicsLet GRS$ _k(\boldsymbol{\alpha}, \boldsymbol{\upsilon}) $ be a $ k $-dimensional generalized Reed-Solomon (GRS) code over $ \mathbb{F}_q $ associated with $ \boldsymbol{\alpha} = (\alpha_1, \ldots, \alpha_n) $ and $ \boldsymbol{\upsilon} = (\upsilon_1,
Jing Huang, Jingge Liu , Dong Yu
doaj +1 more source
Properties and Construction of Polar Codes [PDF]
, 2010 Recently, Ar{\i}kan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel. In the thesis, we show that decoding algorithm of polar codes,
Mori, Ryuhei
core
Coding for reliable satellite communications [PDF]
Several error control coding techniques for reliable satellite communications were investigated to find algorithms for fast decoding of Reed-Solomon codes in terms of dual basis. The decoding of the (255,223) Reed-Solomon code, which is used as the outer
Lin, S.
core +1 more source