Datasets
Open Access
MRLA search results and source code
- Citation Author(s):
-
FabianSchwartau
TU Braunschweig, IHFYannicSchröderTU Braunschweig, IBRLarsWolfTU Braunschweig, IBR - Submitted by:
- Fabian Schwartau
- Last updated:
- Tue, 05/17/2022 - 22:21
- DOI:
- 10.21227/cd4b-nb07
- Link to Paper:
- License:
296 Views- Categories:
- Keywords:
Abstract
The dataset includes both the software and the results for the calculation of large Minimum Redundancy Linear Arrays (MRLA, also known as sparse rulers).
The software uses an exhausive search to find perfect and optimal sparse rulers. The results include all rulers up to 213 and the combination of length and marks of the rulers up to a length of 244.
The source code contains readme files on how to compile, install and execute the program.
The combinations of array length (L) and mark count (M) for perfect rulers are listed in combinations.txt. The results found for each L/M combination are presented in seperate files each, containing the rulers encoded in differences of positions of the marks. An exponent defines how many times this distance occurs in sequence. E.g. {1², 4², 3} would expand to the ruler xxxoooxoooxoox, where x represents a mark and o represents the absecense of a mark.
Dataset Files
mrla_20201106.zip (8.42 MB)
Open Access dataset files are accessible to all logged in users. Don't have a login? Create a free IEEE account. IEEE Membership is not required.
