Results 251 to 260 of about 531,952 (296)
Some of the next articles are maybe not open access.
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
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
Error-correcting codes and cryptography
Applicable Algebra in Engineering, Communication and Computing, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hideki Imai, Manabu Hagiwara
openaire +1 more source
Metacyclic error-correcting codes
Applicable Algebra in Engineering, Communication and Computing, 1995The group codes are ideals of group algebras. Let \(G\) and \(H\) be groups of the same order, \(F\) be a finite field, let \(FG\) and \(FH\) be the corresponding group rings. The combinatorial equivalence is an \(F\) vector space isomorphism \(\gamma: FG\to FH\) induced by a bijection \(\gamma: G\to H\). Codes \(C1 \subseteq FG\) and \(C2 \subseteq FH\
Roberta Evans Sabin, Samuel J. Lomonaco
openaire +1 more source
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
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
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 +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
Good error-correcting codes based on very sparse matrices
Proceedings of IEEE International Symposium on Information Theory, 1997D. MacKay
semanticscholar +1 more source
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
IEEE International Conference on Communications, 1993C. Berrou, A. Glavieux, P. Thitimajshima
semanticscholar +1 more source
Corrections to “Analog Error-Correcting Codes”
IEEE Transactions on Information Theory, 2023openaire +1 more source