Results 71 to 80 of about 773 (112)

Support Of Noiseproof Coding With The Help Of Spline-Waveletes

open access: yesБезопасность информационных технологий, 2015
In this article presents the error correcting codes, constructed on a spline-wavelets reconstruction, comparing of presented codes with the existing line codes is carried out.
Alla Borisovna Levina   +1 more
doaj  

Machine learning discovers new champion codes

open access: yesnpj Artificial Intelligence
Linear error-correcting codes form the mathematical backbone of modern digital communication and storage systems, but identifying champion linear codes (linear codes achieving or exceeding the best known minimum Hamming distance) remains challenging.
Yang-Hui He   +3 more
doaj   +1 more source

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  

Steganography and error-correcting codes

Signal Processing, 2007
CARLOS Munuera
exaly   +2 more sources

Error Correcting Network Codes

Computer Networks, 2021
Abstract Network coding (NC) is a novel forwarding technique that promise to change many aspects of networking. However, the error propagation problem in NC resulting from the encoding on the Network layer makes the error-correcting process performed classically on the Physical layer very expensive in terms of computational resources, especially when
Mohamed Amine Belhamra, El Mamoun Souidi
openaire   +1 more source

Parallel error correcting codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2002
Summary: We introduce the concept of ``parallel error correcting'' codes, the error correcting codes for parallel channels. Here, a parallel channel is a set of channels such that the additive error over a finite field occurs in one of its members at time \(T\) if the same error occurs in all members at the same time. The set of codewords of a parallel
R Ahlswede, Ning Cai
exaly   +4 more sources

Error-Correcting Codes for Flash Coding

IEEE Transactions on Information Theory, 2011
Flash memory is a non-volatile computer storage device which consists of blocks of cells. While increasing the voltage level of a single cell is fast and simple, reducing the level of a cell requires the erasing of the entire block containing the cell. Since block-erasures are costly, traditional flash coding schemes have been developed to maximize the
Qin Huang 0002   +2 more
openaire   +1 more source

Error correcting coding for OTN

IEEE Communications Magazine, 2010
Forward error correction codes for 100 Gb/s optical transmission are currently receiving much attention from transport network operators and technology providers. We discuss the performance of hard decision decoding using product type codes that cover a single OTN frame or a small number of such frames.
Jørn Justesen   +2 more
openaire   +1 more source

Error-correcting WOM-codes

IEEE Transactions on Information Theory, 1991
A problem raised by R.L. Rivest and A. Shamir (1982), namely, constructing write-once-memory (WOM) codes capable of error correction, is considered. The authors call a (n,m,t)-WOM code a scheme that allows t successive writings of m arbitrary bits (i.e., one message among 2/sup m/) on a WOM of size n.
Gilles Zémor, Gérard D. Cohen
openaire   +1 more source

Network coding and error correction

Proceedings of the IEEE Information Theory Workshop, 2003
We introduce network error-correcting codes for error correction when a source message is transmitted to a set of receiving nodes on a network. The usual approach in existing networks, namely link-by-link error correction, is a special case of network error correction. The network generalizations of the Hamming bound and the Gilbert-Varshamov bound are
Ning Cai 0001, Raymond W. Yeung
openaire   +1 more source

Home - About - Disclaimer - Privacy