Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDesigns, Codes and Cryptography, Volume 81
Volume 81, Number 1, October 2016
- Haode Yan
, Chunlei Liu:
Two classes of cyclic codes and their weight enumerator. 1-9 - Michelle Kendall, Keith M. Martin:
Graph-theoretic design and analysis of key predistribution schemes. 11-34 - Aida Abiad, Willem H. Haemers:
Switched symplectic graphs and their 2-ranks. 35-41 - Shantian Cheng, Khoa Nguyen, Huaxiong Wang:
Policy-based signature scheme from lattices. 43-74 - Matan Banin, Boaz Tsaban:
A reduction of Semigroup DLP to classic DLP. 75-82 - Ciaran Mullan, Boaz Tsaban:
SL2 homomorphic hash functions: worst case to average case reduction and short collision search. 83-107 - Chun Guo, Dongdai Lin:
Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour. 109-129 - John Bamberg, Melissa Lee, Eric Swartz:
A note on relative hemisystems of Hermitian generalised quadrangles. 131-144 - Michael Braun:
New infinite series of 2-designs over the binary and ternary field. 145-152 - Chengju Li, Sunghan Bae, Jaehyun Ahn, Shudi Yang, Zheng-an Yao:
Complete weight enumerators of some linear codes and their applications. 153-168 - Trygve Johnsen, Keisuke Shiromoto, Hugues Verdure:
A generalization of Kung's theorem. 169-178
Volume 81, Number 2, November 2016
- Alfredo Rial:
Blind attribute-based encryption and oblivious transfer with fine-grained access control. 179-223 - Yan Liu, Chunlei Liu:
A class of cyclic codes whose duals have five zeros. 225-238 - Boran Kim, Yoonjin Lee:
Construction of extremal self-dual codes over ℤ8 and ℤ16. 239-257 - László Mérai, Arne Winterhof:
On the linear complexity profile of some sequences derived from elliptic curves. 259-267 - Bence Csajbók, Corrado Zanella:
On the equivalence of linear sets. 269-281 - Zhengchun Zhou, Nian Li, Cuiling Fan, Tor Helleseth:
Linear codes with two or three weights from quadratic Bent functions. 283-295 - Zihui Liu, Xin-Wen Wu:
The fullrank value function. 297-315 - Minquan Cheng, Jing Jiang, Haiyan Li, Ying Miao, Xiaohu Tang:
Bounds and constructions for 3¯-separable codes with length 3. 317-335 - Wilfried Meidl, Harald Niederreiter:
Multisequences with high joint nonlinear complexity. 337-346 - Steven T. Dougherty, Cristina Fernández-Córdoba:
Kernels and ranks of cyclic and negacyclic quaternary codes. 347-364 - R. Julian R. Abel, Robert F. Bailey, Andrea C. Burgess, Peter Danziger, Eric Mendelsohn:
On generalized Howell designs with block size three. 365-391
Volume 81, Number 3, December 2016
- Yanfeng Wang, Wenling Wu:
New criterion for diffusion property and applications to improved GFS and EGFN. 393-412 - Abdulla Eid, Hilaf Hasson, Amy Ksir, Justin D. Peachey:
Suzuki-invariant codes from the Suzuki curve. 413-425 - Cícero Carvalho, Rafael Peixoto, Fernando Torres:
Near weights on higher dimensional varieties. 427-443 - Antonio Cossidente, Francesco Pavese:
Veronese subspace codes. 445-457 - Daqing Wan, Qiang Wang:
Index bounds for character sums of polynomials over finite fields. 459-468 - Yuuki Kageyama, Tatsuya Maruta:
On the geometric constructions of optimal linear codes. 469-480 - Xiaoqin Zhan, Shenglin Zhou:
Flag-transitive non-symmetric 2-designs with (r, λ)=1 and sporadic socle. 481-487 - Sanming Zhou:
Total perfect codes in Cayley graphs. 489-504 - Yanbin Zheng, Pingzhi Yuan, Dingyi Pei:
Large classes of permutation polynomials over Fq2. 505-521 - Huaifeng Chen, Tingting Cui, Meiqin Wang:
Improving algorithm 2 in multidimensional (zero-correlation) linear cryptanalysis using χ2-method. 523-540 - Hyun Jin Kim, Yoonjin Lee:
Complementary information set codes over GF(p). 541-555
a service of 
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-04-22 20:03 CEST 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:
