2015/05/04 by Emanuele Bellini, Massimiliano Sala, Bellini, Emanuele +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1505.00542
openalex publication_date 2015/05/04 · arxiv created 2015/05/05 · arxiv updated 2015/05/06 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
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.