Titlebook: Coding and Cryptology; Second International Yeow Meng Chee,Chao Li,Chaoping Xing Conference proceedings 2009 Springer-Verlag Berlin Heidelb

我在爭斗志

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




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




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




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




書目名稱Coding and Cryptology被引頻次




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




書目名稱Coding and Cryptology年度引用




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




書目名稱Coding and Cryptology讀者反饋




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

兇兆

https://doi.org/10.1007/b138397e arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to substantial improvements on known existence results for binary covering arrays of strengths four and five.

無聊的人

Water-Brash

https://doi.org/10.1007/978-3-030-15374-8 number of such curves for which both the curve and its twist have a number of points which is prime. In a work in progress theoretical extimates are obtained wherein the number of such points on both curves has a prescribed arithmetic structure.

組裝

Christine Strothotte,Thomas Strothotteinator is also discussed..The second concerns an infinite family of .-regular bipartite graphs with large girth constructed in [8]. The LDPC codes based on these graphs have attracted much attention. We show that the first few of these graphs are Ramanujan graphs.

ordain

ordain

Binary Covering Arrays and Existentially Closed Graphs,e arising from the Paley graphs and tournaments. Computational results on arrays generated by column translation, such as the Paley graphs, lead to substantial improvements on known existence results for binary covering arrays of strengths four and five.

Constant

盤旋

Amorous