Bhattar, Raghunadh K and Ramakrishnan, KR and Dasgupta, KS (2010) On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding. In: IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS), JUN 25-27, 2010, N China Elect Power Univ, Beijing, PEOPLES R CHINA, pp. 280-284.
Computation.pdf - Published Version
Restricted to Registered users only
Download (249Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2010 IEEE. Personal use of this material is permitted.However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Minimum distance; Linear block codes; Information sets; Generalized inverse|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||23 Mar 2011 09:43|
|Last Modified:||23 Mar 2011 09:43|
Actions (login required)