Results 231 to 240 of about 11,470 (258)
Some of the next articles are maybe not open access.
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
An Introduction to Error-Correcting Codes
IEEE Transactions on Communications, 1973Herbert O. Burton, Shih-Yung Tong
openaire +1 more source
A survey of error-correcting codes for channels with symbol synchronization errors
IEEE Communications Surveys and Tutorials, 2010Hugues Mercier +2 more
exaly
New single-error-correcting codes
IEEE Transactions on Information Theory, 1996P R J Ostergard
exaly
Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
IEEE Transactions on Information Theory, 1981P Piret, P Delsarte
exaly
A new multilevel coding method using error-correcting codes
IEEE Transactions on Information Theory, 1977S Hirakawa
exaly
Design of efficient error-correcting balanced codes
IEEE Transactions on Computers, 1993S Al-Bassam, B Bose
exaly