IEICE TRANSACTIONS on Fundamentals
Granular Gain of Low-Dimensional Lattices from Binary Linear Codes
Summary :
Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.12 pp.2168-2170
- Publication Date
- 2012/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.2168
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Misako KOTANI, Shingo KAWAMOTO, Motohiko ISAKA, "Granular Gain of Low-Dimensional Lattices from Binary Linear Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 12, pp. 2168-2170, December 2012, doi: 10.1587/transfun.E95.A.2168.
Abstract: Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.2168/_p
Copy
@ARTICLE{e95-a_12_2168,
author={Misako KOTANI, Shingo KAWAMOTO, Motohiko ISAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Granular Gain of Low-Dimensional Lattices from Binary Linear Codes},
year={2012},
volume={E95-A},
number={12},
pages={2168-2170},
abstract={Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.},
keywords={},
doi={10.1587/transfun.E95.A.2168},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Granular Gain of Low-Dimensional Lattices from Binary Linear Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2168
EP - 2170
AU - Misako KOTANI
AU - Shingo KAWAMOTO
AU - Motohiko ISAKA
PY - 2012
DO - 10.1587/transfun.E95.A.2168
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2012
AB - Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.
ER -
English
