找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Error Control, Cryptology, and Speech Compression; Workshop on Informat Andrew Chmora,Stephen B. Wicker Conference proceedings 1994 Springe

[复制链接]
楼主: 帐簿
发表于 2025-3-25 03:44:56 | 显示全部楼层
Pravinkumar B. Sehgal,Igor TammIn this paper a short description of concatenated codes with inner convolutional codes is given. The distance parameters of such codes can be estimated using the extended row and column distances of the inner and outer codes.
发表于 2025-3-25 08:26:54 | 显示全部楼层
Magdalena Stolarska,Nicoleta TarfuleaA linear block decoding method in which decoding is reduced to the repeated decoding of shortened codes is proposed. The algorithm for constructing coverings from codewords, which are necessary for the proposed technique, is provided. A tables of such coverings for a number of binary BCH and quadratic-residue (QR) codes is presented.
发表于 2025-3-25 12:43:41 | 显示全部楼层
Tomás A. Reader,Catherine StrazielleThe problem of reducing the number of multiplications in infinite response filtering is considered. We show how this operation may be decomposed on finite response filtrations and so-named halfconvolutions. Examples of the efficient procedures for filters of low order are presented.
发表于 2025-3-25 16:49:02 | 显示全部楼层
发表于 2025-3-25 21:17:55 | 显示全部楼层
,How to avoid the Sidel’nikov-Shestakov attack,Recently [2] Sidel‘nikov and Shestakov showed how to break the Niederreiter Public-Key Cryptosystem. It is proposed to make breaking this PKC based on Generalized Reed-Solomon codes more difficult by randomizing the parity check matrix. The modified Niederreiter system appears to be secure.
发表于 2025-3-26 01:28:25 | 显示全部楼层
发表于 2025-3-26 06:06:27 | 显示全部楼层
Codes that correct two-dimensional burst errors,Metrics are defined which describe array bursts. Spectra for these metrics, bounds for optimal codes and code constructions are discussed.
发表于 2025-3-26 10:08:18 | 显示全部楼层
Self-checking decoding algorithm for Reed-Solomon codes,The definitions of error secure and self-checking algorithms are given. It is shown that decoding algorithms for Reed-Solomon codes over . can be transformed in self-checking algorithms for a set . of single algorithmic errors. The two kinds of check functions of error secure decoding algorithms of Reed-Solomon codes are described.
发表于 2025-3-26 14:46:31 | 显示全部楼层
发表于 2025-3-26 17:36:32 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-24 23:45
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表