The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
A b-기호 읽기 채널은 다음과 같은 채널 모델입니다. b 연속된 기호를 한 번에 읽습니다. 특별한 경우로 기호 쌍 읽기 채널(b=2) 및 일반 채널(b=1). 구형 패킹 경계, GV(Gilbert-Varshamov) 경계 및 기호 쌍 읽기 채널에 대한 점근적 GV 경계는 다음과 같이 알려져 있습니다. b=1과 2. 본 논문에서는 다음 세 가지 경계를 도출합니다. b-기호 읽기 채널 b≥1. 제안된 GV 한계 분석을 통해 달성 가능한 비율이 더 높은 것으로 확인되었습니다. b-Hamming 메트릭을 기반으로 일반 채널과 비교한 기호 읽기 채널입니다. 또한, 최적의 값이 표시됩니다. b 점근적 GV 경계를 최대화하는 것은 분수 최소 거리에 따라 유한하게 결정됩니다.
Seunghoan SONG
Osaka University
Toru FUJIWARA
Osaka University
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.
부
Seunghoan SONG, Toru FUJIWARA, "Sphere Packing Bound and Gilbert-Varshamov Bound for b-Symbol Read Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 11, pp. 1915-1924, November 2018, doi: 10.1587/transfun.E101.A.1915.
Abstract: A b-symbol read channel is a channel model in which b consecutive symbols are read at once. As special cases, it includes a symbol-pair read channel (b=2) and an ordinary channel (b=1). The sphere packing bound, the Gilbert-Varshamov (G-V) bound, and the asymptotic G-V bound for symbol-pair read channels are known for b=1 and 2. In this paper, we derive these three bounds for b-symbol read channels with b≥1. From analysis of the proposed G-V bound, it is confirmed that the achievable rate is higher for b-symbol read channels compared with those for ordinary channels based on the Hamming metric. Furthermore, it is shown that the optimal value of b that maximizes the asymptotic G-V bound is finitely determined depending on the fractional minimum distance.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1915/_p
부
@ARTICLE{e101-a_11_1915,
author={Seunghoan SONG, Toru FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Sphere Packing Bound and Gilbert-Varshamov Bound for b-Symbol Read Channels},
year={2018},
volume={E101-A},
number={11},
pages={1915-1924},
abstract={A b-symbol read channel is a channel model in which b consecutive symbols are read at once. As special cases, it includes a symbol-pair read channel (b=2) and an ordinary channel (b=1). The sphere packing bound, the Gilbert-Varshamov (G-V) bound, and the asymptotic G-V bound for symbol-pair read channels are known for b=1 and 2. In this paper, we derive these three bounds for b-symbol read channels with b≥1. From analysis of the proposed G-V bound, it is confirmed that the achievable rate is higher for b-symbol read channels compared with those for ordinary channels based on the Hamming metric. Furthermore, it is shown that the optimal value of b that maximizes the asymptotic G-V bound is finitely determined depending on the fractional minimum distance.},
keywords={},
doi={10.1587/transfun.E101.A.1915},
ISSN={1745-1337},
month={November},}
부
TY - JOUR
TI - Sphere Packing Bound and Gilbert-Varshamov Bound for b-Symbol Read Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1915
EP - 1924
AU - Seunghoan SONG
AU - Toru FUJIWARA
PY - 2018
DO - 10.1587/transfun.E101.A.1915
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2018
AB - A b-symbol read channel is a channel model in which b consecutive symbols are read at once. As special cases, it includes a symbol-pair read channel (b=2) and an ordinary channel (b=1). The sphere packing bound, the Gilbert-Varshamov (G-V) bound, and the asymptotic G-V bound for symbol-pair read channels are known for b=1 and 2. In this paper, we derive these three bounds for b-symbol read channels with b≥1. From analysis of the proposed G-V bound, it is confirmed that the achievable rate is higher for b-symbol read channels compared with those for ordinary channels based on the Hamming metric. Furthermore, it is shown that the optimal value of b that maximizes the asymptotic G-V bound is finitely determined depending on the fractional minimum distance.
ER -