Expected complexity analysis of increasing radii algorithm by considering multiple radius schedules

DOI10.1049/iet-com.2012.0232zbMath1273.94010OpenAlexW1964184824MaRDI QIDQ2852762

Heung-No Lee, Junil Ahn, Kiseon Kim

Publication date: 18 October 2013

Published in: IET Communications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7a0be1f8283b916164ea4dace9c31262b9fed6b7

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

This page was built for publication: Expected complexity analysis of increasing radii algorithm by considering multiple radius schedules