On the existence of retransmission permutation arrays

DOI10.1016/J.DAM.2013.04.017zbMATH Open1285.05022arXiv1210.8223OpenAlexW2964004379MaRDI QIDQ2444573FDOQ2444573

Xian De Zhang, Ian M. Wanless

Publication date: 10 April 2014

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

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)$.

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)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)