找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Coding Theory and Cryptography; From Enigma and Gehe David Joyner Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Coding

[復(fù)制鏈接]
查看: 12043|回復(fù): 55
樓主
發(fā)表于 2025-3-21 16:58:32 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Coding Theory and Cryptography
副標(biāo)題From Enigma and Gehe
編輯David Joyner
視頻videohttp://file.papertrans.cn/229/228895/228895.mp4
概述The book covers up-to-date research in the form of surveys in an extremely hot field..Includes supplementary material:
圖書封面Titlebook: Coding Theory and Cryptography; From Enigma and Gehe David Joyner Conference proceedings 2000 Springer-Verlag Berlin Heidelberg 2000 Coding
描述These are the proceedings of the Conference on Coding Theory, Cryptography, and Number Theory held at the U. S. Naval Academy during October 25-26, 1998. This book concerns elementary and advanced aspects of coding theory and cryptography. The coding theory contributions deal mostly with algebraic coding theory. Some of these papers are expository, whereas others are the result of original research. The emphasis is on geometric Goppa codes (Shokrollahi, Shokranian-Joyner), but there is also a paper on codes arising from combinatorial constructions (Michael). There are both, historical and mathematical papers on cryptography. Several of the contributions on cryptography describe the work done by the British and their allies during World War II to crack the German and Japanese ciphers (Hamer, Hilton, Tutte, Weierud, Urling). Some mathematical aspects of the Enigma rotor machine (Sherman) and more recent research on quantum cryptography (Lomonoco) are described. There are two papers concerned with the RSA cryptosystem and related number-theoretic issues (Wardlaw, Cosgrave).
出版日期Conference proceedings 2000
關(guān)鍵詞Coding theory; Graph; MDS-Code; Prime; algorithms; communication; cryptography; finite field; number theory;
版次1
doihttps://doi.org/10.1007/978-3-642-59663-6
isbn_softcover978-3-540-66336-2
isbn_ebook978-3-642-59663-6
copyrightSpringer-Verlag Berlin Heidelberg 2000
The information of publication is updating

書目名稱Coding Theory and Cryptography影響因子(影響力)




書目名稱Coding Theory and Cryptography影響因子(影響力)學(xué)科排名




書目名稱Coding Theory and Cryptography網(wǎng)絡(luò)公開度




書目名稱Coding Theory and Cryptography網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Coding Theory and Cryptography被引頻次




書目名稱Coding Theory and Cryptography被引頻次學(xué)科排名




書目名稱Coding Theory and Cryptography年度引用




書目名稱Coding Theory and Cryptography年度引用學(xué)科排名




書目名稱Coding Theory and Cryptography讀者反饋




書目名稱Coding Theory and Cryptography讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:51:49 | 只看該作者
Ombretta Repetto,Karine Gallardoometry and finite geometry. Further, we exhibit a complete .-arc over the field .., for even .. In the last section we discuss a connection between modular representations of the general linear group over .. and the question of whether a given cyclic code is MDS.
板凳
發(fā)表于 2025-3-22 00:47:12 | 只看該作者
“I Do Not Need Help to Define Myself”all going under the BP code name of Sturgeon, while the Siemens T43 probably was the unbreakable machine that BP called Thrasher. The T43 machine came into use relatively late in the war and appears to have been used only on a few selected circuits.
地板
發(fā)表于 2025-3-22 07:04:34 | 只看該作者
5#
發(fā)表于 2025-3-22 09:43:39 | 只看該作者
6#
發(fā)表于 2025-3-22 16:03:48 | 只看該作者
ings of the Conference on Coding Theory, Cryptography, and Number Theory held at the U. S. Naval Academy during October 25-26, 1998. This book concerns elementary and advanced aspects of coding theory and cryptography. The coding theory contributions deal mostly with algebraic coding theory. Some of
7#
發(fā)表于 2025-3-22 19:50:24 | 只看該作者
8#
發(fā)表于 2025-3-22 23:57:37 | 只看該作者
9#
發(fā)表于 2025-3-23 02:24:23 | 只看該作者
10#
發(fā)表于 2025-3-23 06:13:44 | 只看該作者
Sangeeta Dhaubhadel,Frédéric Marsolaisffine line. In the second half we will design algorithms for computing roots of polynomials over the function field of a nonsingular absolutely irreducible plane algebraic curve. Several examples are included.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-25 03:34
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
连城县| 郁南县| 湘乡市| 延庆县| 东光县| 福海县| 苗栗县| 花莲市| 定安县| 灌云县| 眉山市| 锦屏县| 休宁县| 镇坪县| 永丰县| 唐山市| 景德镇市| 阿坝| 孟津县| 水城县| 冀州市| 成武县| 阜平县| 肇东市| 兴业县| 顺义区| 海宁市| 渝中区| 和政县| 南城县| 普格县| 和静县| 天镇县| 呼玛县| 巴林左旗| 苗栗县| 镇雄县| 涞源县| 工布江达县| 清丰县| 东乌珠穆沁旗|