找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algebraic Coding; First French-Soviet Gérard Cohen,Antoine Lobstein,Simon Litsyn Conference proceedings 1992 Springer-Verlag Berlin Heidel

[复制链接]
楼主: 你太谦虚
发表于 2025-3-26 22:55:40 | 显示全部楼层
A fast search for the maximum element of the fourier spectrum,An algorithm for determining the index of the maximum spectrum element of the Fourier transform is proposed. Its complexity is linear in the length of the processed sequence. The algorithm leads to the correct decision if the Euclidean distance between the sequence and a basis vector does not exceed √(q/2), where q is the length of the sequence.
发表于 2025-3-27 04:57:09 | 显示全部楼层
发表于 2025-3-27 08:43:55 | 显示全部楼层
Decoding for multiple-access channels,We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users‘ energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.
发表于 2025-3-27 11:02:50 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152557.jpg
发表于 2025-3-27 16:57:16 | 显示全部楼层
On the correlation of sequences,at the moduli of certain character sums can be calculated in a very easy way by using a modification of a method of Sidelnikov. These results yield a very simple way to calculate .. for nonbinary sequences found by Kumar and Moreno and for those found by Liu and Komo.
发表于 2025-3-27 21:33:05 | 显示全部楼层
Exponential sums and constrained error-correcting codes,. are slowly growing functions in the code length .. We show also that constructed codes are comma-free and detect synchronization errors even at high rate of additive errors. To prove these properties of constructed codes, we apply some well-known inequalities for incomplete sums of characters of polynomials.
发表于 2025-3-27 23:35:01 | 显示全部楼层
发表于 2025-3-28 05:32:44 | 显示全部楼层
Conference proceedings 1992 in Leningrad (nowSt. Petersburg) in 1990, was to bring together someof thebest Soviet coding theorists. Scientists from France,Finland, Germany, Israel, Italy, Spain, and the UnitedStates also attended.The papers in the volume fall rather naturally into fourcategories:-Applications of exponential sums- Covering radius- Constructions-Decoding.
发表于 2025-3-28 07:37:56 | 显示全部楼层
发表于 2025-3-28 13:34:56 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 14:49
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表