Extending the known families of scalable Huffman sequences
T. C. Petersen, D. M. Paganin, I. D. Svalbe

TL;DR
This paper introduces new constructions of scalable Huffman sequences with delta-like auto-correlations, extending known families and providing practical methods for deconvolving data in multidimensional applications.
Contribution
It presents novel methods for constructing canonical Huffman sequences of various lengths, including complex-scaled and Fibonacci-based arrays, and introduces a two-mask de-correlation technique for imaging.
Findings
New Huffman sequences of lengths 4n+1, 2n, and arbitrary lengths are constructed.
Fibonacci-based arrays with perfect auto-correlation properties are developed.
A two-mask de-correlation method reduces radiation dose in imaging applications.
Abstract
A canonical Huffman sequence is characterized by a zero inner-product between itself and each of its shifted copies, except at their largest relative shifts: their aperiodic auto-correlation then becomes delta-like, a single central peak surrounded by zeros, with one non-zero entry at each end. Prior work showed that the few known families of Huffman sequences (of length , for integers , with continuously scalable elements) are based upon Fibonacci polynomials. Related multi-dimensional () Huffman arrays were designed, as well as non-canonical quasi-Huffman arrays that also possess delta-like auto-correlations. We examined links between these discrete sequences and delta-correlated functions defined on the continuum, and provided simple non-iterative approaches to successfully deconvolve data blurred by diffuse Huffman arrays. Here we describe new constructions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Coding theory and cryptography · Wireless Communication Networks Research
