Results 231 to 240 of about 12,027 (259)
Some of the next articles are maybe not open access.

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

An Introduction to Error-Correcting Codes

IEEE Transactions on Communications, 1973
Herbert 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, 2010
Hugues Mercier, Vahid Tarokh
exaly  

Period distribution for error-correcting codes

Computers and Mathematics With Applications, 1993
Yi Xian Yang
exaly  

Some Codes Correcting Asymmetric Errors of Limited Magnitude

IEEE Transactions on Information Theory, 2011
Jinquan Luo   +2 more
exaly  

A new multilevel coding method using error-correcting codes

IEEE Transactions on Information Theory, 1977
S Hirakawa
exaly  

Bounds and constructions for codes correcting unidirectional errors

IEEE Transactions on Information Theory, 1989
J H Weber, D E Boekee
exaly  

Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)

IEEE Transactions on Information Theory, 1981
P Delsarte, P Piret
exaly  

Home - About - Disclaimer - Privacy