A note on reducing the computation time for minimum distance and equivalence check of binary linear codes

Journal Title: Mathematical and Software Engineering - Year 2018, Vol 4, Issue 2

Abstract

In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have also considered the usefulness of combinatorial 2-(t,k,1) designs when there are memory limitations to the number of objects (linear codes in particular) that can be tested for equivalence.

Authors and Affiliations

Nikolay Yankov, Krassimir Enev

Keywords

Related Articles

Determination of Single Knife Edge Equivalent Parameters for Double Knife Edge Diffraction Loss by Deygout Method

In this paper, the computation of dual knife edge diffraction loss by Deygout multiple knife edge diffraction loss method is presented for a 6 GHz C-band microwave link. Also, the computation of equivalent single kni...

Differential Fade Depth with Path Length Adjustment (DFD-PLA) Method for Computing the Optimal Path Length of Terrestrial Fixed Point Line of Sight Microwave Link

In this paper, development of Differential Fade Depth with Path Length Adjustment (DFD-PLA) algorithm for calculating the optimal path length for fixed point terrestrial line of sight microwave communication link is pres...

Applied Software for Managing a Small Business

In this paper we present software solution for managing a small business with fixed number of products, prices and quantities. The presented software application is developed on a dot NET platform using programming langu...

Algorithms for Extended Galois Field Generation and Calculation

The paper aims to suggest algorithms for Extended Galois Field generation and calculation. The algorithm analysis shows that the proposed algorithm for finding primitive polynomial is faster than traditional polynomial s...

Development of Sales and Inventory Workflow Management Information System Web Portal for Petrospan Integrated Services, Eket, Akwa Ibom State, Nigeria

In this paper, the development of Sales and Inventory Workflow Management Information System (SIWfMS) web portal for Petrospan Integrated Services, Eket, Akwa Ibom state, Nigeria was presented. Rapid Application Developm...

Download PDF file
  • EP ID EP382670
  • DOI -
  • Views 117
  • Downloads 0

How To Cite

Nikolay Yankov, Krassimir Enev (2018). A note on reducing the computation time for minimum distance and equivalence check of binary linear codes. Mathematical and Software Engineering, 4(2), 18-23. https://europub.co.uk/articles/-A-382670