Results 231 to 240 of about 27,057 (260)
Some of the next articles are maybe not open access.

Binoid error-correcting codes

IEEE Transactions on Information Theory, 1973
The purpose of this paper is to develop more general techniques for the synthesis of error-correcting codes that dispense with the requirement that coding elements and operations must be associated with finite fields. This approach permits an extension of the class of coded messages and coding operations and leads in certain cases to a reduction of ...
openaire   +2 more sources

Multiple error-correcting WOM-codes

2010 IEEE International Symposium on Information Theory, 2010
A 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   +2 more sources

Error-correcting Codes, I

1979
In Chapter I-13, we looked at ways of coding messages so that if in the transmission an error occurred in one of the digits of a coded word, the receiver would be able to correct the error. Those codes, called Hamming codes, were based on defining coded words as vectors of solutions in ℤ2 to sets of linear equations.
openaire   +1 more source

Analog Error-Correcting Codes

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   +1 more source

Error-Correcting Codes in Projective Space

2008 IEEE International Symposium on Information Theory, 2008
The projective space of order n over the finite field Fq, denoted Pq(n), is the set of all subspaces of the vector space Fn q. The distance function d(U,V) = dim U + dim V - 2 dim(UcapV) turns Pq(n) into a metric space. With this, an (n, M, d) code C in projective space is a subset of Pq(n) of size M such that the distance between any two codewords ...
Tuvi Etzion, Alexander Vardy
openaire   +1 more source

The Horace Method for Error-Correcting Codes

Applicable Algebra in Engineering, Communication and Computing, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ballico, Edoardo, Fontanari, Claudio
openaire   +2 more sources

The complexity of error-correcting codes

1997
By 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

Non-Binary Error Correction Codes*

Bell System Technical Journal, 1957
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Realization of an Error-Correcting Surface Code with Superconducting Qubits

Physical Review Letters, 2022
Futian Liang   +2 more
exaly  

Home - About - Disclaimer - Privacy