Characterization and classification of optimal ternary linear one-dimensional hull codes

The hull of a code \(C\) is \(\text{Hull}(C)=C\cap C^\bot,\) where \(C^\bot\) is the dual of \(C.\) If \(\dim(\text{Hull}(C))=h_\ell\) then \(C\) is termed \(h_\ell\)-linear or linear \(\ell\)-dimensional hull code. A code is Linear Complementary Dual (LCD) if \(h_\ell=0.\)\N\NIn this work, ternary linear one-dimensional hull codes are studied, and some classical techniques for shortening and puncturing codes are explored. These methods are applied to LCD codes, and some bounds on the minimum distance of the codes obtained are shown.\N\NA classification method is presented for dimensions \(k=2\) and \(k=3\). The study considers the largest minimum distance \(d_1(n, k)\) among all ternary linear one-dimensional hull \([n, k]\) codes for \(n \leq 20\) or \(k \leq 3\). Furthermore, optimal ternary \(h_1\)-linear \([n, 2]\) codes and classified, and \(h_1\)-linear \([12, 2, 8]_3,\) \([12, 4, 6]_3,\) \([12, 5, 6]_3,\) and \([12, 6, 5]_3\) codes are constructed. These codes possess better minimum distances compared with previously known results.

Cites work

This page was built for publication: Characterization and classification of optimal ternary linear one-dimensional hull codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987560)