Results 181 to 190 of about 634 (212)
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
Corrections to “Analog Error-Correcting Codes”
IEEE Transactions on Information Theory, 2023openaire +1 more source
A Revisit of Linear Network Error Correction Coding
IEEE Journal on Selected Areas in Information Theory, 2023Raymond Yeung, Xuan Guang
exaly
An Introduction to Error-Correcting Codes
IEEE Transactions on Communications, 1973Herbert O. Burton, Shih-Yung Tong
openaire +1 more source
Autoencoder-Based Error Correction Coding for One-Bit Quantization
IEEE Transactions on Communications, 2020Eren Balevi, Jeffrey Andrews
exaly
Optimizing Joint Erasure- and Error-Correction Coding for Wireless Packet Transmissions
IEEE Transactions on Wireless Communications, 2008Peter Willett +2 more
exaly
On Capacity of Network Error Correction Coding With Random Errors
IEEE Communications Letters, 2018Ning Cai, Wangmei Guo
exaly