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
- EP ID EP382670
- DOI -
- Views 141
- Downloads 0
Online Math Tasks Generator
This article presents “Math for all” – a web application that generates various algebraic equations and inequalities. We discuss algorithms and methods that are implemented in building the library that generates all the...
Evaluation of the Distribution of Terrain Roughness Index for Terrestrial Line of Site Microwave Links in Uyo Metropolis
In this paper, the distribution of terrain roughness index in Uyo metropolis is presented. The path (elevation) profiles of various regions or areas in Uyo are captured and then used to compute the terrain roughness inde...
Design of Web-Based Customer Relation Management Application for Power Distribution Company: A Case Study of PHCN Owerri Business Unit
In this paper, the design of web-based customer care application for power distribution company is presented with Power Holding Company of Nigeria (PHCN) Owerri business unit as the case study. The system is developed t...
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...
Application of sorting algorithms for convex hull determination
The proposed research explores the possibilities of applying some base algorithms for sorting to the process of finding a convex in order to optimize the time indicators of this process. A comparative analysis of the tim...