Computational moments for sequential decoding of convolutional codes
IEEE Transactions on Information Theory, 1979 - ieeexplore.ieee.org
The long standing conjecture is established that, for a discrete memoryless channel, there
exists a linear convolutional code with infinite constraint length such that the ρ th (ρ ≧ 1) …
exists a linear convolutional code with infinite constraint length such that the ρ th (ρ ≧ 1) …
[引用][C] Computational moments for sequential decoding of convolutional codes
T Hashimoto, S Arimoto - IEEE Transactions on Information Theory, 1979 - cir.nii.ac.jp
Computational moments for sequential decoding of convolutional codes | CiNii Research CiNii
国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データを …
国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データを …
[引用][C] COMPUTATIONAL MOMENTS FOR SEQUENTIAL DECODING OF CONVOLUTIONAL CODES
T HASHIMOTO, S ARIMOTO - 1979 - pascal-francis.inist.fr
COMPUTATIONAL MOMENTS FOR SEQUENTIAL DECODING OF CONVOLUTIONAL
CODES CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases …
CODES CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases …
Computational moments for sequential decoding of convolutional codes
T Hashimoto, S Arimoto - IEEE Transactions on Information Theory, 2006 - dl.acm.org
The long standing conjecture is established that, for a discrete memoryless channel, there
exists a linear convolutional code with infinite constraint length such that the rho th (rho geq …
exists a linear convolutional code with infinite constraint length such that the rho th (rho geq …
[引用][C] Computational moments for sequential decoding of convolutional codes
T HASHIMOTO - IEEE Trans. Inform. Theory, 1979 - cir.nii.ac.jp