A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays

DOI10.1007/S10623-008-9226-2zbMath1237.94131OpenAlexW2074072130MaRDI QIDQ1009110

Horst Trinker

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9226-2

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (1)

Fourier-reflexive partitions and MacWilliams identities for additive codes

Cites Work

• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Codes for the \(m\)-metric
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• A direct approach to linear programming bounds for codes and tms-nets
• Bounds on ordered codes and orthogonal arrays
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• The Complete Weight Enumerator for Codes over M nxs(F q)

This page was built for publication: A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays