找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
樓主: 你太謙虛
31#
發(fā)表于 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.
32#
發(fā)表于 2025-3-27 04:57:09 | 只看該作者
33#
發(fā)表于 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.
34#
發(fā)表于 2025-3-27 11:02:50 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152557.jpg
35#
發(fā)表于 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.
36#
發(fā)表于 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.
37#
發(fā)表于 2025-3-27 23:35:01 | 只看該作者
38#
發(fā)表于 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.
39#
發(fā)表于 2025-3-28 07:37:56 | 只看該作者
40#
發(fā)表于 2025-3-28 13:34:56 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-16 18:35
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
鹿邑县| 丹东市| 泽普县| 休宁县| 沾化县| 岳阳市| 襄汾县| 兴海县| 民权县| 北票市| 新竹县| 大悟县| 漾濞| 辉县市| 额济纳旗| 留坝县| 周至县| 南昌县| 拜城县| 于都县| 砚山县| 通辽市| 鹰潭市| 玉溪市| 和田市| 麻阳| 山东| 辽中县| 临沂市| 阳东县| 黄陵县| 满城县| 蛟河市| 福清市| 无棣县| 上杭县| 潢川县| 新丰县| 嘉禾县| 天门市| 阳谷县|