@inproceedings{6264faf4a0f24275b744447e16104ff4,
title = "Puncturing, expurgating and expanding the q-ary BCH based robust codes",
abstract = "A code that can detect any non-zero error with probability greater than zero is called robust. The set of codewords that mask an error e determine its undetected error probability, Q(e). The maximal error masking probability is denoted by Qmc. A robust code is called optimum if there is no other code with larger number of codewords with the same length and the same Q mc. In this paper we present constructions of optimum and nearly optimum robust codes. The constructions are based on modifications of the BCH based check matrix codes. In particular, puncturing, expurgating and expanding the codes while preserving their robustness.",
keywords = "BCH based codes, Combining codes, Error masking, Nonlinear codes, Robust codes, Undetected error",
author = "Nir Admaty and Simon Litsyn and Osnat Keren",
year = "2012",
doi = "10.1109/eeei.2012.6376995",
language = "אנגלית",
isbn = "9781467346801",
series = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",
booktitle = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",
note = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 ; Conference date: 14-11-2012 Through 17-11-2012",
}