Bounds on minimum distance for linear codes over GF(5)

DOI10.1007/S002000050117zbMath0933.94035OpenAlexW1969401961MaRDI QIDQ1304997

T. Aaron Gulliver, Rumen N. Daskalov

Publication date: 6 April 2000

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050117

zbMATH Keywords

quasi-cyclic codesminimum Hamming distancelinear codes of GF(5)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (5)

Unnamed Item ⋮ Non-binary quantum synchronizable codes based on cyclic codes over \(\mathrm{F}_q\) ⋮ New minimum distance bounds for linear codes over GF(5). ⋮ Some high-rate linear codes over \(\text{GF}(5)\) and \(\text{GF}(7)\) ⋮ New quasi-cyclic codes over \({\mathbb F}_{5}\)

This page was built for publication: Bounds on minimum distance for linear codes over GF(5)