找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 18th International S Maria Bras-Amorós,Tom H?holdt Conference proceedings

[復(fù)制鏈接]
樓主: deliberate
51#
發(fā)表于 2025-3-30 08:15:07 | 只看該作者
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-642-02181-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
52#
發(fā)表于 2025-3-30 15:18:11 | 只看該作者
https://doi.org/10.1007/978-90-481-2383-4rithm, both designed to solve a key equation. This article presents a new version of the key equation and a way to use the Euclidean algorithm to solve it. A straightforward reorganization of the algorithm yields the Berlekamp-Massey algorithm.
53#
發(fā)表于 2025-3-30 17:27:27 | 只看該作者
https://doi.org/10.1007/978-90-481-2383-4s and properties as the codes in the usual binary linear Reed-Muller family have been introduced. A structural invariant, the rank, for binary codes is used to classify some of these ?.-linear codes. The rank is established generalizing the known results about the rank for ?.-linear Hadamard and ?.-linear extended 1-perfect codes.
54#
發(fā)表于 2025-3-31 00:38:26 | 只看該作者
https://doi.org/10.1007/978-90-481-2383-4f the BIBD graphs and show that they yield optimal expander graphs that are also bipartite Ramanujan graphs. In particular, we show that the bipartite graphs derived from finite projective and affine geometries yield optimal Ramanujan graphs. This in turn leads to a theoretical explanation of the good performance of a class of LDPC codes.
55#
發(fā)表于 2025-3-31 01:14:07 | 只看該作者
Sakib Bin Amin,Saanjaana Rahman.. and give a necessary and sufficient condition for the self-duality of induced codes. We then give an inductive algorithm for constructing all self-dual codes over .., and establish the mass formula, which counts the number of such codes.
56#
發(fā)表于 2025-3-31 05:56:00 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159620.jpg
57#
發(fā)表于 2025-3-31 09:48:54 | 只看該作者
An Extension of the Order Bound for AG Codesng-Rao bound. By using a finer partition of the set of all codewords of a code we improve the order bounds by Beelen and by Duursma and Park. We show that the new bound can be efficiently optimized and we include a numerical comparison of different bounds for all two-point codes with Goppa distance
58#
發(fā)表于 2025-3-31 16:08:41 | 只看該作者
59#
發(fā)表于 2025-3-31 20:00:42 | 只看該作者
60#
發(fā)表于 2025-4-1 01:07:15 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 14:44
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
澄迈县| 兴化市| 漳平市| 琼中| 信宜市| 浦县| 修武县| 永昌县| 阳谷县| 济南市| 阜平县| 灌云县| 文水县| 定边县| 岢岚县| 百色市| 永济市| 务川| 宾阳县| 浦江县| 博白县| 沧州市| 榆林市| 漯河市| 疏附县| 义马市| 安康市| 呼伦贝尔市| 清镇市| 霍山县| 彭水| 永泰县| 申扎县| 醴陵市| 轮台县| 丘北县| 抚松县| 贺州市| 营山县| 且末县| 南涧|