DocumentCode :
3439543
Title :
On computation of minimum distance of linear block codes above 1/2 rate coding
Author :
Bhattar, Raghunadh K. ; Ramakrishnan, K.R. ; Dasgupta, K.S.
fYear :
2010
fDate :
25-27 June 2010
Firstpage :
280
Lastpage :
284
Abstract :
The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.
Keywords :
Algebra; Block codes; Code standards; Computer errors; Cryptography; Ear; Equations; Error correction codes; Linear code; Vectors; Generalized inverse; Information sets; Linear block codes; Minimum distance;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Information Security (WCNIS), 2010 IEEE International Conference on
Conference_Location :
Beijing, China
Print_ISBN :
978-1-4244-5850-9
Type :
conf
DOI :
10.1109/WCINS.2010.5541937
Filename :
5541937
Link To Document :
بازگشت