Puncturing, expurgating and expanding the q-ary BCH based robust codes

Nir Admaty, Simon Litsyn, Osnat Keren

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
DOIs
StatePublished - 2012
Event2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 - Eilat, Israel
Duration: 14 Nov 201217 Nov 2012

Publication series

Name2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012

Conference

Conference2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Country/TerritoryIsrael
CityEilat
Period14/11/1217/11/12

Keywords

  • BCH based codes
  • Combining codes
  • Error masking
  • Nonlinear codes
  • Robust codes
  • Undetected error

Fingerprint

Dive into the research topics of 'Puncturing, expurgating and expanding the q-ary BCH based robust codes'. Together they form a unique fingerprint.

Cite this