Results 51 to 60 of about 106,176 (185)

Reed-solomon forward error correction (FEC) schemes, RFC 5510 [PDF]

open access: yes, 2009
This document describes a Fully-Specified Forward Error Correction (FEC) Scheme for the Reed-Solomon FEC codes over GF(2^^m), where m is in {2..16}, and its application to the reliable delivery of data objects on the packet erasure channel (i.e., a ...
Lacan, Jérôme   +3 more
core  

On the Error Performance of Coding and Equalization in Low-Complexity Ultra-Wideband Communication Systems

open access: yesJournal of Communications Software and Systems, 2006
In this paper, the performance of various channel coding schemes is investigated in pulse-based ultra-wideband(UWB) communication systems for applications in short-range indoor environments.
Robert H. Morelos-Zaragoza
doaj  

On Algebraic Decoding of $q$-ary Reed-Muller and Product-Reed-Solomon Codes

open access: yes, 2007
We consider a list decoding algorithm recently proposed by Pellikaan-Wu \cite{PW2005} for $q$-ary Reed-Muller codes $\mathcal{RM}_q(\ell, m, n)$ of length $n \leq q^m$ when $\ell \leq q$.
Santhi, Nandakishore
core   +1 more source

Performance Analysis of Identification Codes

open access: yesEntropy, 2020
In this paper, we analyze the construction of identification codes. Identification codes are based on the question: “Is the message I have just received the one I am interested in?”, as opposed to Shannon’s transmission, where the receiver is interested ...
Sencer Derebeyoğlu   +2 more
doaj   +1 more source

A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes

open access: yes, 2012
Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix.
Gauthier, Valérie   +2 more
core   +1 more source

Proximity Gaps for Reed–Solomon Codes

open access: yes2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020
A collection of sets displays a proximity gap with respect to some property if for every set in the collection, either (i) all members are δ-close to the property in relative Hamming distance or (ii) only a tiny fraction of members are δ-close to the property. In particular, no set in the collection has roughly half
Eli Ben-Sasson   +4 more
openaire   +2 more sources

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  

Performance of Soft Viterbi Decoder enhanced with Non-Transmittable Codewords for storage media

open access: yesCogent Engineering, 2018
The introduction of Non-Transmittable Codewords (NTCs) into Viterbi Algorithm Decoder has emerged as one of the best ways of improving performance of the Viterbi Algorithm Decoder.
Kilavo Hassan   +2 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  

Home - About - Disclaimer - Privacy