The Complexity of Bit Retrieval

DOI10.1109/TIT.2017.2754485zbMath1390.94814arXiv1601.03428OpenAlexW2963446797MaRDI QIDQ4566643

Veit Elser

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03428

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (9)

Learning without loss ⋮ Circumcentering reflection methods for nonconvex feasibility problems ⋮ Applying iterated mapping to the no-three-in-a-line problem ⋮ Matrix product constraints by projection methods ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Finite alphabet phase retrieval ⋮ Benchmark Problems for Phase Retrieval ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Toward a Mathematical Theory of the Crystallographic Phase Retrieval Problem

This page was built for publication: The Complexity of Bit Retrieval