Channel Coding: Efficient Decoding of General Codes
channel coding, efficient decoding, general linear binary codes
We develop efficient decoders for short block codes.
Arising applications, such as machine-to-maschine communication require error-correction codes with short information length.The design of such codes and efficient decoders is an open problem .
One approach to obtain good results in the short-length regime is using the best-known codes .
Since these codes do usually not have a structure that enables efficient decoding, one has to perform decoding of a general linear code. The most efficient approaches are variants of Ordered Statistics Decoding (OSD) . The idea for improving over state-of-the-art varaints is to encorporate recent improvements from another field of research: Information Set Decoding.
If you are interested in the poposed direction (or have some other direction in mind), please write an email, then we'll discuss the details.
 Co?kun, M. C., Durisi, G., Jerkovits, T., Liva, G., Ryan, W., Stein, B., & Steiner, F. (2019). Efficient error-correcting codes in the short blocklength regime. Physical Communication, 34, 66-79.
 Markus Grassl. "Bounds on the minimum distance of linear codes and quantum codes." Online available at http://www.codetables.de.
 Fossorier, M. P., & Lin, S. (1995). Soft-decision decoding of linear block codes based on ordered statistics. IEEE Transactions on Information Theory, 41(5), 1379-1396.
stochastics and combinatorics are helpful
some experience with the AWGN channel