Powerline communication and the 36 officers problem

DOI10.1098/rsta.2006.1885zbMath1152.05301OpenAlexW2131029388WikidataQ40272070 ScholiaQ40272070MaRDI QIDQ5301902

Sophie Huczynska

Publication date: 20 January 2009

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2006.1885

zbMATH Keywords

coding theorypermutation arrayspowerline communication

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Modulation and demodulation in information and communication theory (94A14)

Related Items (10)

On generalized Howell designs with block size three ⋮ Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ Permutation codes with specified packing radius ⋮ A bound on permutation codes ⋮ Constructing permutation arrays from groups ⋮ Extending permutation arrays: improving MOLS bounds ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ Constructing permutation arrays using partition and extension ⋮ A new table of permutation codes ⋮ Error-correcting codes from permutation groups

Cites Work

• A combinatorial problem in the symmetric group

This page was built for publication: Powerline communication and the 36 officers problem