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

arXiv, 2021.

Research output: Working paper

Published

Standard

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

arXiv, 2021.

Research output: Working paper

Harvard

APA

Vancouver

Author

BibTeX

@techreport{7081da99e6b44a808c21e88fc6caf40d,
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 = "2021",
month = aug,
day = "6",
language = "English",
publisher = "arXiv",
type = "WorkingPaper",
institution = "arXiv",

}

RIS

TY - UNPB

T1 - Constructing orientable sequences

AU - Mitchell, Chris J

AU - Wild, Peter R

PY - 2021/8/6

Y1 - 2021/8/6

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.

M3 - Working paper

BT - Constructing orientable sequences

PB - arXiv

ER -