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影响因子(影响力)学科排名




书目名称Coding and Cryptology网络公开度




书目名称Coding and Cryptology网络公开度学科排名




书目名称Coding and Cryptology被引频次




书目名称Coding and Cryptology被引频次学科排名




书目名称Coding and Cryptology年度引用




书目名称Coding and Cryptology年度引用学科排名




书目名称Coding and Cryptology读者反馈




书目名称Coding and Cryptology读者反馈学科排名

凶兆

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