A Caltech Library Service

Bounds for Self-Dual Codes Over ℤ_4

Rains, Eric (2000) Bounds for Self-Dual Codes Over ℤ_4. Finite Fields and Their Applications, 6 (2). pp. 146-163. ISSN 1071-5797. doi:10.1006/ffta.1999.0258.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


New bounds are given for the minimal Hamming and Lee weights of self-dual codes over ℤ_4. For a self-dual code of length n, the Hamming weight is bounded above by 4[n/24]+f(n mod 24), for an explicitly given function f; the Lee weight is bounded above by 8[n/24]+g(n mod 24), for a different function g. These bounds appear to agree with the full linear programming bound for a wide range of lengths. The proof of these bounds relies on a reduction to a problem of binary codes, namely that of bounding the minimum dual distance of a doubly even binary code.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 2000 Academic Press. Received 3 February 1998, Revised 25 January 1999.
Subject Keywords:Hamming, Lee, bounds; self-dual Full-size image Z4 code
Issue or Number:2
Record Number:CaltechAUTHORS:20171003-100542142
Persistent URL:
Official Citation:Eric Rains, Bounds for Self-Dual Codes Over Z4, Finite Fields and Their Applications, Volume 6, Issue 2, April 2000, Pages 146-163, ISSN 1071-5797, (
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:81985
Deposited By: Tony Diaz
Deposited On:03 Oct 2017 21:01
Last Modified:15 Nov 2021 19:47

Repository Staff Only: item control page