24 August 2017 Binary block codes from Euclidean embeddings and random hyperplane tessellations
Author Affiliations +
Abstract
In this paper we use Euclidean embeddings and random hyperplane tessellations to construct binary block codes. The construction proceeds in two stages. First, an auxiliary ternary code is chosen which consists of vectors in the union of coordinate subspaces. The subspaces are selected so that any two vectors of different support have a sufficiently large distance. In addition, any two ternary vectors from the auxiliary codebook that have common support are at a guaranteed minimum distance. In the second stage, the auxiliary ternary code is converted to a binary code by an additional random hyperplane tessellation.
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bernhard G. Bodmann, Bernhard G. Bodmann, Robert P. Mendez, Robert P. Mendez, } "Binary block codes from Euclidean embeddings and random hyperplane tessellations", Proc. SPIE 10394, Wavelets and Sparsity XVII, 103940M (24 August 2017); doi: 10.1117/12.2273917; https://doi.org/10.1117/12.2273917
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

Recovery of quantized compressed sensing measurements
Proceedings of SPIE (March 11 2015)
Multi-target compressive laser ranging
Proceedings of SPIE (May 22 2014)
Compressive full waveform lidar
Proceedings of SPIE (May 04 2017)
Face recognition via a projective compressive sensing system
Proceedings of SPIE (February 13 2012)

Back to Top