Abstract
In this paper we use the Gröbner representation of a binary linear code [Formula: see text] to give efficient algorithms for computing the whole set of coset leaders, denoted by [Formula: see text] and the set of leader codewords, denoted by [Formula: see text]. The first algorithm could be adapted to provide not only the Newton and the covering radius of [Formula: see text] but also to determine the coset leader weight distribution. Moreover, providing the set of leader codewords we have a test-set for decoding by a gradient-like decoding algorithm. Another contribution of this article is the relation established between zero neighbors and leader codewords.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
