Bounds and Modifications on Linear Error-block Codes
نویسندگان
چکیده
Abstract In 2006, K. Feng, L. Xu and F. J. Hickernell initiated the concept of a linear error-block code which is a natural generalization of the classical linear code. In this correspondence, we investigate optimal linear errorblock codes in two directions: maximal dimension codes and maximal minimum π-distance codes. First perspective on optimizing a code is by studying lower bounds and upper bounds on dimension of a code. Various bounds developed in this research provide tools used in obtaining more efficient codes which in some cases lead to optimal codes. The later approach is by modifying suitable existing linear errorblock codes so that the optimal ones are rewarded.
منابع مشابه
Constructions and bounds on linear error-block codes
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over F2. We also study the asymptotic of linear error-block codes. We define the real valued function αq,m,a(δ), which is an analog of the importa...
متن کاملDecoding Error Probability of Binary Linear Block Codes
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
The performance of non-binary linear block codes is studied in this paper via the derivation of new upper bounds on the error probability under ML decoding. The transmission of these codes is assumed to take place over a memoryless and symmetric channel. The new bounds, which rely on the Gallager bounding technique, are applied to expurgated ensembles of non-binary and regular low-density parit...
متن کاملError Locating Codes by Using Blockwise-tensor Product of Blockwise Detecting/correcting Codes
In this paper, we obtain lower and upper bounds on the number of parity check digits of a linear code that corrects e or less errors within a subblock. An example of such a code is provided. We introduce blockwise-tensor product of matrices and using this, we propose classes of error locating codes (or EL-codes) that can detect e or less errors within a sub-block and locate several such corrupt...
متن کاملOn linear unequal error protection codes
It is possible for a linear block code to provide more protection against errors for selected mess~ge positions than is guaranteed by the minimum distance of the code. Codes having this property are called Linear Unequal Error Protection (LUEP) codes. In this report the optimal encoding of LUEP codes is discussed and bounds on the length of a code that ensures a given unequal error protection a...
متن کامل