Powerline communication and the 36 officers problem

DOI10.1098/RSTA.2006.1885MaRDI QIDQ5301902zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Constructions for permutation codes in powerline communications
• A new table of permutation codes
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Constructing permutation arrays using partition and extension
• Classes of permutation arrays in finite projective spaces

Cites work

• A combinatorial problem in the symmetric group

Cited in

(11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301902)