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

Comparative Analysis of the ITU Multipath Fade Depth Models for Microwave Link Design in the C, Ku, and Ka-Bands

In this paper, the effects of various wireless network link parameters on the multipath fade depth are presented. The link parameters considered are frequency, path inclination, path length, terrain roughness index and...

Preliminary Context Analysis of Social Network Web Application for Combating HIV/AIDS Stigmatization

In this paper, context model and preliminary context analysis are presented for a niche Social Network Web Application (SNWA) for combating HIV/AIDS related stigmatization. The contexts model show the stakeholders and ho...

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...

Comparative Analysis of the Impact of Frequency on the Radius of Curvature of Single and Double Rounded Edge Hill Obstruction

In this paper, comparative analysis of the impact of frequency on the radius of curvature of single and double rounded edge hill obstruction is studied, particularly when the International Telecommunication Union (ITU) r...

Modelling and Forecasting of Residential Electricity Consumption in Nigeria Using Multiple Linear Regression Model and Quadratic Regression Model with Interactions

In this paper statistical analysis of residential electricity demand in Nigeria is presented. Multiple linear regression model and quadratic regression model with interactions are applied to estimate residential electric...

Download PDF file
  • EP ID EP382670
  • DOI -
  • Views 101
  • 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