On the existence of retransmission permutation arrays

DOI10.1016/J.DAM.2013.04.017MaRDI QIDQ2444573zbMATH OpenOpenAlexFDO

Authors Ian M. Wanless, Xian De Zhang

Publication date 10 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.8223

zbMATH Keywords

Latin squareLatin rectangleretransmission permutation array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an $nimesn$ array in which each row is a permutation of $1,\mathrm{...},n$, and for $1leqileqn$, all $n$ symbols occur in each $iimeslceilfracniceil$ rectangle in specified corners of the array. The array has types 1, 2, 3 and 4 if the stated property holds in the top left, top right, bottom left and bottom right corners, respectively. It is called latin if it is a latin square. We show that for all positive integers $n$, there exists a type-$1,2,3,4$ $RPA(n)$ and a type-1,2 latin $RPA(n)$.

Recommendations

• Constructions for retransmission permutation arrays
• Perpendicular rectangular Latin arrays
• scientific article; zbMATH DE number 4214013
• scientific article; zbMATH DE number 4177065
• scientific article; zbMATH DE number 874517

Cites work

• An existence theorem for latin squares
• Constructions for retransmission permutation arrays
• Extending subpermutation matrices in regular classes of matrices

Cited in

(2)

• Constructions for retransmission permutation arrays
• scientific article; zbMATH DE number 4081747 (Why is no real title available?)

This page was built for publication: On the existence of retransmission permutation arrays

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