A deterministic algorithm for the distance and weight distribution of binary nonlinear codes
From MaRDI portal
Publication:1993387
DOI10.1504/IJICOT.2018.091816zbMATH Open1431.94205arXiv1505.00542OpenAlexW1896489828WikidataQ129783256 ScholiaQ129783256MaRDI QIDQ1993387FDOQ1993387
Authors: Emanuele Bellini, Massimiliano Sala 
Publication date: 5 November 2018
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
Abstract: Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, and in particular its minimum weight and its minimum distance, which takes advantage of fast Fourier techniques. This algorithm's performance is similar to that of best-known algorithms for the average case, while it is especially efficient for codes with low information rate. We provide complexity estimates for several cases of interest.
Full work available at URL: https://arxiv.org/abs/1505.00542
Recommendations
- Computing the distance distribution of systematic nonlinear codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- On computing the weight spectrum of cyclic codes
- Determination of the Local Weight Distribution of Binary Linear Block Codes
- scientific article; zbMATH DE number 871187
Cited In (5)
- Computing the distance distribution of systematic nonlinear codes
- A formula on the weight distribution of linear codes with applications to AMDS codes
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation
- An average weight-distance enumerator for binary expansions of Reed-Solomon codes
- Characteristic vector and weight distribution of a linear code
This page was built for publication: A deterministic algorithm for the distance and weight distribution of binary nonlinear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993387)
