Higher Weights for Ternary and Quaternary Self-Dual Codes*

Authors:
Steven T. Dougherty;T. Aaron. Gulliver;Manabu Oura
Affiliations:
Department of Mathematics, University of Scranton, Scranton, USA 18510;Department of Electrical and Computer Engineering, University of Victoria, Victoria, Canada V8W 3P6;Division of Mathematics, Sapporo Medical University, Sapporo, Japan 060-8556
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 8
Cited 2

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Support weight distribution of linear codes

Discrete Mathematics - A collection of contributions in honour of Jack van Lint
Algorithms in invariant theory

Algorithms in invariant theory
Handbook of Coding Theory

Handbook of Coding Theory
Higher weights and graded rings for binary self-dual codes

Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Geometric approach to higher weights

IEEE Transactions on Information Theory - Part 1
Optimal double circulant self-dual codes over F4

IEEE Transactions on Information Theory
Bounds on the minimum support weights

IEEE Transactions on Information Theory

A generalized Gleason---Pierce---Ward theorem

Designs, Codes and Cryptography
On some new m-spotty Lee weight enumerators

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study higher weights applied to ternary and quaternary self-dual codes. We give lower bounds on the second higher weight and compute the second higher weights for optimal codes of length less than 24. We relate the joint weight enumerator with the higher weight enumerator and use this relationship to produce Gleason theorems. Graded rings of the higher weight enumerators are also determined.