Linear ternary quasiperfect codes correcting double errors

MaRDI QIDQ1090307zbMATH OpenFDO

Authors I. B. Gashkov, V. M. Sidel'nikov

Publication date 1986

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

double-error-correcting ternary linear codesnumber of fixed-weight codewords

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Review text

The authors construct double-error-correcting ternary linear codes of length \(n=(3^ k+1)/2\), \(k=1,2,..\). with 2k check digits, which are quasiperfect (for even k they are also cyclic). Asymptotic expressions are derived for the number of fixed-weight codewords.

Recommendations

• scientific article; zbMATH DE number 4021019
• On perfect ternary constant weight codes
• scientific article; zbMATH DE number 3922530
• New good quasi-cyclic ternary and quaternary linear codes
• scientific article; zbMATH DE number 2154102

Cited in

(8)

• Correction of multiple errors by q-ary codes
• The parameters of subcodes of algebraic-geometric codes over prime subfields
• Fast algorithm of square rooting in some finite fields of odd characteristic
• Quasi-perfect linear codes from planar and APN functions
• On the error-correcting performance of some binary and ternary linear codes
• scientific article; zbMATH DE number 3922530 (Why is no real title available?)
• scientific article; zbMATH DE number 4021019 (Why is no real title available?)
• scientific article; zbMATH DE number 2154102 (Why is no real title available?)

This page was built for publication: Linear ternary quasiperfect codes correcting double errors

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