Optimal almost equisymbol codes based on difference matrices

DOI10.1134/S0032946014040024zbMath1398.94232OpenAlexW1968175920MaRDI QIDQ2352634

L. A. Bassalygo, Victor A. Zinoviev

Publication date: 3 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946014040024

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Grey-Rankin bound for nonbinary codes
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Concerning difference matrices
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Generalized Hadamard Matrices
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications

This page was built for publication: Optimal almost equisymbol codes based on difference matrices