Nearly Optimal Robust Positioning Patterns

DOI10.1109/TIT.2021.3118905zbMATH Open1489.68092OpenAlexW3207890434MaRDI QIDQ5030278FDOQ5030278

Hengjia Wei

Publication date: 17 February 2022

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

Full work available at URL: https://doi.org/10.1109/tit.2021.3118905

zbMATH Keywords

Singleton boundinfinite familyrobust positioning pattern

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Bounds on codes (94B65)

Cited In (1)

• Optimal position targeting via decoupling fields

This page was built for publication: Nearly Optimal Robust Positioning Patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030278)