Constructing orientable sequences. / Mitchell, Chris J; Wild, Peter R.

In: IEEE Transactions on Information Theory, Vol. 68, No. 7, 07.2022, p. 4782-4789.

Research output: Contribution to journalArticlepeer-review

Published

Standard

Constructing orientable sequences. / Mitchell, Chris J; Wild, Peter R.

In: IEEE Transactions on Information Theory, Vol. 68, No. 7, 07.2022, p. 4782-4789.

Research output: Contribution to journalArticlepeer-review

Harvard

Mitchell, CJ & Wild, PR 2022, 'Constructing orientable sequences', IEEE Transactions on Information Theory, vol. 68, no. 7, pp. 4782-4789. https://doi.org/10.1109/TIT.2022.3158645

APA

Mitchell, C. J., & Wild, P. R. (2022). Constructing orientable sequences. IEEE Transactions on Information Theory, 68(7), 4782-4789. https://doi.org/10.1109/TIT.2022.3158645

Vancouver

Mitchell CJ, Wild PR. Constructing orientable sequences. IEEE Transactions on Information Theory. 2022 Jul;68(7):4782-4789. https://doi.org/10.1109/TIT.2022.3158645

Author

Mitchell, Chris J ; Wild, Peter R. / Constructing orientable sequences. In: IEEE Transactions on Information Theory. 2022 ; Vol. 68, No. 7. pp. 4782-4789.

BibTeX

@article{482047f48e18499e8df3fdd02729f6c4,
title = "Constructing orientable sequences",
abstract = "This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such sequences have potential applications in automatic position-location systems, where the sequence is encoded onto a surface and a reader needs only examine n consecutive encoded bits to determine its location and orientation on the surface. The only previously described method of construction (due to Dai et al.) is somewhat complex, whereas the new techniques are simple to both describe and implement. The methods of construction cover both the standard `infinite periodic' case, and also the aperiodic, finite sequence, case. Both the new methods build on the Lempel homomorphism, first introduced as a means of recursively generating de Bruijn sequences.",
author = "Mitchell, {Chris J} and Wild, {Peter R}",
year = "2022",
month = jul,
doi = "10.1109/TIT.2022.3158645",
language = "English",
volume = "68",
pages = "4782--4789",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

RIS

TY - JOUR

T1 - Constructing orientable sequences

AU - Mitchell, Chris J

AU - Wild, Peter R

PY - 2022/7

Y1 - 2022/7

N2 - This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such sequences have potential applications in automatic position-location systems, where the sequence is encoded onto a surface and a reader needs only examine n consecutive encoded bits to determine its location and orientation on the surface. The only previously described method of construction (due to Dai et al.) is somewhat complex, whereas the new techniques are simple to both describe and implement. The methods of construction cover both the standard `infinite periodic' case, and also the aperiodic, finite sequence, case. Both the new methods build on the Lempel homomorphism, first introduced as a means of recursively generating de Bruijn sequences.

AB - This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such sequences have potential applications in automatic position-location systems, where the sequence is encoded onto a surface and a reader needs only examine n consecutive encoded bits to determine its location and orientation on the surface. The only previously described method of construction (due to Dai et al.) is somewhat complex, whereas the new techniques are simple to both describe and implement. The methods of construction cover both the standard `infinite periodic' case, and also the aperiodic, finite sequence, case. Both the new methods build on the Lempel homomorphism, first introduced as a means of recursively generating de Bruijn sequences.

UR - https://arxiv.org/abs/2108.03069

U2 - 10.1109/TIT.2022.3158645

DO - 10.1109/TIT.2022.3158645

M3 - Article

VL - 68

SP - 4782

EP - 4789

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

ER -