Characters and the Equivalence of Codes

Authors: Ward H.N.1; Wood J.A.2

Source: Journal of Combinatorial Theory, Series A, Volume 73, Number 1, February 1996 , pp. 348-352(5)

Publisher: Academic Press

Buy & download fulltext article:

OR

Price: $52.63 plus tax (Refund Policy)

Abstract:

MacWilliams proved that two linear codes are equivalent up to monomial transformations if and only if there is a weight-preserving linear isomorphism between them. We present a new proof based on the linear independence of group characters. We also present a new proof of a theorem of Bonisoli characterizing constant weight codes.

Language: English

Document Type: Miscellaneous

Affiliations: 1: Department of Mathematics, University of Virginia, Charlottesville, Virginia, 22903 2: Department of Mathematics, Computer Science and Statistics, Purdue University Calumet, Hammond, Indiana, 46323

Publication date: 1996-02-01

Related content

Tools

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page