Title :
On subset subcodes of linear codes
Author :
Urivskiy, Alexey
Author_Institution :
JSC InfoTeCS, Moscow, Russia
Abstract :
We consider a problem of finding codes over alphabets whose size s is not equal to the size of any finite field. We adopted an approach when a linear block code is taken over some finite field GF(q) such that q >; s. Then a subcode is being found such that all the code symbols of all its codewords belong to a subset of GF(q) of size s. Upper and lower bounds on the cardinality of the subset subcode are given. Also coding procedures are considered. Error detection and/or correction procedures are those of the parent code.
Keywords :
block codes; error correction codes; error detection codes; linear codes; code symbols; error correction code; error detection codes; finite field; linear block code; lower bounds; parent code; subset subcodes; upper bounds; Decoding; Encoding; Estimation; Parity check codes; Redundancy; Systematics; Vectors;
Conference_Titel :
Problems of Redundancy in Information and Control Systems (RED), 2012 XIII International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4673-0168-8
DOI :
10.1109/RED.2012.6338415
