An introduction to divisible codes
type: Item
instance of: scholarly article
title: An introduction to divisible codes
zbMATH Open document ID: 0938.94014
DOI: 10.1023/A:1008302520762
author: Harold N. Ward
published in: Designs, Codes and Cryptography
publication date: 2000-01-24T00:00:00Z
review text: A linear code is called divisible if all codeword weights have a nontrivial common divisor. The author presents in this paper some basic facts about divisible codes, culminating in a ``divisible'' version of the Gleason-Pierce theorem on self-dual codes.
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 1392728
zbMATH Keywords: divisible codes
zbMATH Keywords: Gleason-Pierce theorem
zbMATH Keywords: self-dual codes
MaRDI profile type: Publication
full work available at URL: a:1008302520762
OpenAlex ID: W1557416906
Recommended article: Q4538683
Recommended article: On the Lengths of Divisible Codes
Recommended article: Divisible codes
Recommended article: A bound for divisible codes
Recommended article: Q4242008
Recommended article: An Introduction to Linear and Cyclic Codes
Recommended article: The divisible code bound revisited
Recommended article: On the Codes Generated by Certain Divisible Designs
Recommended article: Divisors of codes of Reed-Muller type
Recommended article: Q4242016
description: scientific article; zbMATH DE number 1392728