Results 251 to 260 of about 2,707,764 (285)
Some of the next articles are maybe not open access.
On error-correcting balanced codes
IEEE Transactions on Information Theory, 1989Results are presented on families of balanced binary error-correcting codes that extend those in the literature. The idea is to consider balanced blocks as symbols over an alphabet and to construct error-correcting codes over that alphabet. Encoding and decoding procedures are presented. Several improvements to the general construction are discussed.
Tilborg, van, H.C.A., Blaum, M.
openaire +1 more source
Multiple error-correcting WOM-codes
2010 IEEE International Symposium on Information Theory, 2010A Write Once Memory (WOM) is a storage medium with binary memory elements, called cells, that can change from the zero state to the one state only once. Examples of WOMs are punch cards, optical disks, and more recently flash memories. WOM-codes were first presented by Rivest and Shamir and are designed for efficiently storing and updating data in the ...
Eitan Yaakobi +3 more
openaire +3 more sources
IEEE Transactions on Information Theory, 2019
Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into the device by setting an array of resistors to have conductances proportional to the respective entries ...
openaire +2 more sources
Coding schemes are presented that provide the ability to locate computational errors above a prescribed threshold while using analog resistive devices for approximate real vector–matrix multiplication. In such devices, the matrix is programmed into the device by setting an array of resistors to have conductances proportional to the respective entries ...
openaire +2 more sources
Codes for the correction of 'clustered' errors
IEEE Transactions on Information Theory, 1960A method is described which permits the systematic construction of codes capable of error-free transmission, provided errors occur in "clusters" of limited duration. The method is valid for error clusters of any prescribed duration. The codes are relatively easy to implement and decoding operations are straightforward.
openaire +1 more source
The complexity of error-correcting codes
1997By concatenating linear-time codes with small, good codes, it is possible to construct in polynomial time a family of asymptotically good codes that approach the Shannon bound that can be encoded and decoded in linear time. Moreover, their probability of decoder error is exponentially small in the block length of the codes.
openaire +1 more source
Corrections to “Analog Error-Correcting Codes”
IEEE Transactions on Information Theory, 2023openaire +2 more sources
Autoencoder-Based Error Correction Coding for One-Bit Quantization
IEEE Transactions on Communications, 2020Eren Balevi, Jeffrey Andrews
exaly
An Introduction to Error-Correcting Codes
IEEE Transactions on Communications, 1973Herbert O. Burton, Shih-Yung Tong
openaire +1 more source
A Revisit of Linear Network Error Correction Coding
IEEE Journal on Selected Areas in Information Theory, 2023Raymond W. Yeung, Xuan Guang
exaly