default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCryptography and Communications, Volume 9
Volume 9, Number 1, January 2017
- Cunsheng Ding, Zhengchun Zhou
:
Preface: Special functions and codes. 1-2 - Kanat S. Abdukhalikov, Sihem Mesnager:
Bent functions linear on elements of some classical spreads and presemifields spreads. 3-21 - Sergey Bezzateev, Natalia A. Shekhunova:
Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets. 23-39 - Ziling Heng, Qin Yue:
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over ℤ 4 Z4. 41-53 - Chengju Li, Sunghan Bae, Haode Yan:
A construction of codes with linearity from two linear codes. 55-69 - Sihem Mesnager:
Linear codes with few weights from weakly regular bent functions based on a generic construction. 71-84 - Qi Wang:
Some cyclic codes with prime length from cyclotomy of order 4. 85-92 - Can Xiang, Chunming Tang, Keqin Feng:
A class of linear codes with a few weights. 93-116 - Guangkui Xu, Xiwang Cao, Shanding Xu:
Two classes of p-ary bent functions and linear codes with three or four weights. 117-131 - Shudi Yang, Zheng-an Yao, Chang-An Zhao:
A class of three-weight linear codes and their complete weight enumerators. 133-149 - Dan Zhang, Cuiling Fan, Daiyuan Peng, Xiaohu Tang:
Complete weight enumerators of some linear codes from quadratic forms. 151-163
Volume 9, Number 2, March 2017
- Yue Zhou, Longjiang Qu:
Constructions of negabent functions over finite fields. 165-180 - Xin Li, Zihui Liu:
On the second relative greedy weight. 181-197 - Lisha Wang, Xiaohu Tang:
On the correlation distribution of the generalized maximal length ℤ4-sequences. 199-215 - Ana Salagean, Matei Mandache-Salagean:
Counting and characterising functions with "fast points" for differential attacks. 217-239 - Rama Krishna Bandi, Maheshanand Bhaintwal, Nuh Aydin:
A mass formula for negacyclic codes of length 2 k and some good negacyclic codes over ℤ4+uℤ4. 241-272 - Elena Dubrova, Martin Hell:
Espresso: A stream cipher for 5G wireless communication systems. 273-289 - Tingting Wu, Jian Gao, Fang-Wei Fu:
1-generator generalized quasi-cyclic codes over ℤ4. 291-299 - Sugata Gangopadhyay, Aditi Kar Gangopadhyay, Spyridon Pollatos, Pantelimon Stanica:
Cryptographic Boolean functions with biased inputs. 301-314
Volume 9, Number 3, May 2017
- Qiuyan Wang, Kelan Ding, Dongdai Lin, Rui Xue:
A kind of three-weight linear codes. 315-322 - Ziling Heng, Qin Yue:
Complete weight distributions of two classes of cyclic codes. 323-343 - Jian Liu, Sihem Mesnager, Lusheng Chen:
On the nonlinearity of S-boxes and linear codes. 345-361 - Jie Peng, Chik How Tan:
New differentially 4-uniform permutations by modifying the inverse function on subfields. 363-378 - Morteza Esmaeili, M. Moosavi, T. Aaron Gulliver:
A new class of Fibonacci sequence based error correcting codes. 379-396 - Minquan Cheng, Jing Jiang, Xiaohu Tang:
Asymptotically optimal 2¯-separable codes with length 4. 397-405 - Miao Liang, Lijun Ji, Jingcai Zhang:
Some new classes of 2-fold optimal or perfect splitting authentication codes. 407-430
Volume 9, Number 4, July 2017
- Zhiqiang Lin, Dongdai Lin, Dingyi Pei:
Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications. 431-443 - Zhixiong Chen:
Linear complexity and trace representation of quaternary sequences over ℤ4 based on generalized cyclotomic classes modulo pq. 445-458 - Madhu Raka, Leetika Kathuria, Mokshi Goyal:
(1-2u 3)-constacyclic codes and quadratic residue codes over 𝔽p[u]/〈u4-u〉. 459-473 - Pramod Kumar Kewat, Priti Kumari:
Cyclic codes from the second class two-prime Whiteman's generalized cyclotomic sequence with order 6. 475-499 - László Mérai, Harald Niederreiter, Arne Winterhof:
Expansion complexity and linear complexity of sequences over finite fields. 501-509 - Hongyu Han, Daiyuan Peng, Udaya Parampalli:
New sets of optimal low-hit-zone frequency-hopping sequences based on m-sequences. 511-522 - Santanu Sarkar, Prakash Dey, Avishek Adhikari, Subhamoy Maitra:
Probabilistic signature based generalized framework for differential fault analysis of stream ciphers. 523-543
Volume 9, Number 5, September 2017
- Xianfang Wang, Jian Gao, Fang-Wei Fu:
Complete weight enumerators of two classes of linear codes. 545-562 - Shuai Xue, Wen-Feng Qi, Xiaoyuan Yang:
On the best linear approximation of addition modulo 2 n. 563-580 - Thalia M. Laing, Keith M. Martin, Maura B. Paterson, Douglas R. Stinson:
Localised multisecret sharing. 581-597 - Yuan Cao, Qingguo Li:
Cyclic codes of odd length over ℤ4 [u] / 〈u k 〉. 599-624 - Xianfang Wang, Can Xiang, Fang-Wei Fu:
Secret sharing schemes for compartmented access structures. 625-635 - Minjia Shi, Rongsheng Wu, Yan Liu, Patrick Solé:
Two and three weight codes over $\mathbb {F}_{p}+u\mathbb {F}_{p}$. 637-646 - Chunming Tang, Yanfeng Qi:
A class of hyper-bent functions and Kloosterman sums. 647-664
Volume 9, Number 6, November 2017
- Saban Alaca, Goldwyn Millar:
Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences. 665-682 - Vladimir Edemskiy, Xiaoni Du:
Design sequences with high linear complexity over finite fields using generalized cyclotomy. 683-691 - Nian Li, Tor Helleseth:
Several classes of permutation trinomials from Niho exponents. 693-705 - LiMengNan Zhou, Daiyuan Peng, Hongbin Liang, ChangYuan Wang, Hongyu Han:
Generalized methods to construct low-hit-zone frequency-hopping sequence sets and optimal constructions. 707-728 - Jacques Wolfmann:
Sequences of bent functions and near-bent functions. 729-736 - Heiko Dietrich, Nathan Jolly:
A new family of arrays with low autocorrelation. 737-748 - Eric Férard:
On the irreducibility of the hyperplane sections of Fermat varieties in ℙ 3 $\mathbb {P}^{3}$ in characteristic 2. II. 749-767
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
