Double Toeplitz codes and their average weight enumerators
Abstract
Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double Toeplitz codes over Fq with some specified minimum weights for q ∈ \2,3,4\. We also give a classification of double Toeplitz codes over Fq with the largest minimum weights for modest lengths and q ∈ \2,3,4\.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.