A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

Tolhuizen L.M.G.M.; Van Gils W.J.

首页> 外文期刊>IEEE Transactions on Information Theory >A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

【24h】

A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

机译：一个大的自同构群减少了线性块码的最佳编码器/解码器对的构造中的计算量

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

For a linear block code it is shown how the number of computations needed for the determination of an optimal encoder/decoder pair can be reduced by using the code's automorphism group. Furthermore, it is shown that the use of an unequal-error-protection-optical generator matrix and a minimum-weight coset leader decoder is suboptimal for a q-ary symmetry channel, but their determination needs less computational effort.

机译：对于线性分组码，示出了如何通过使用代码的自同构组来减少确定最佳编码器/解码器对所需的计算数量。此外，已经表明，对于q进制对称信道，使用不均等错误保护光学生成器矩阵和最小加权陪集前导解码器是次优的，但是确定它们需要较少的计算工作。

著录项

来源
《IEEE Transactions on Information Theory》 |1988年第2期|P.333-338|共6页
作者
Tolhuizen L.M.G.M.; Van Gils W.J.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类无线电电子学、电信技术;
关键词

相似文献

外文文献
中文文献
专利

1. Error probability-based optimal training for linearly decoded orthogonal space-time block coded wireless systems [J] . Ahmed K.I., Tepedelenlioglu C., Spanias A., Communications, IET . 2011,第11期

机译：线性解码正交空时分组编码无线系统的基于错误概率的最佳训练
2. OPTIMAL SYNDROME DECODING OF CONCATENATED CODES WITH SERIAL CONCATENATION VIA AN INTERLEAVER OF CYCLIC LINEAR BLOCK-STRUCTURED CODES [J] . A. N. Khmelkov Telecommunications and Radio Engineering . 2010,第10期

机译：通过循环线性块结构编码的交织，对具有串行合并的并置编码进行最优综合解码
3. Linear-time encodable/decodable codes with near-optimal rate [J] . Guruswami V., Indyk P. IEEE Transactions on Information Theory . 2005,第10期

机译：接近最佳速率的线性时间可编码/可解码代码
4. An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity [C] . Yuansheng Tang, Tadao Kasami, Toru Fujiwara Applied Algebra, Algebraic Algorithms and Error-Correcting Codes . 1999

机译：二进制分组码解码码字的最优测试算法及其计算复杂度
5. Map decoding of linear block codes, iterative decoding of Reed-Solomon codes and interactive concatenated turbo coding systems. [D] . Liu, Ye. 1999

机译：线性分组码的映射解码，里德-所罗门码的迭代解码和交互式串联Turbo编码系统。
6. NOTES TOWARD THE CONSTRUCTION OF NONLINEAR RELATIVISTIC QUANTUM FIELDS I. THE HAMILTONIAN IN TWO SPACE-TIME DIMENSIONS AS THE GENERATOR OF A C*-AUTOMORPHISM GROUP [O] . Irving Segal 1967

机译：关于构造非线性相对论量子场的注意事项I。两个时空维的哈密顿量作为C *-自善群的生成器
7. Soft-Decision Decoding of Linear Block Codes using Efficient Iterative G-Space Encodings [O] . Yingquan Wu, Christoforos Hadjicostis 100

机译：使用有效迭代G空间编码的线性分组码软判决解码

A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for linear block code

摘要

著录项

相似文献

相关主题

期刊订阅