Coding, cryptography and combinatorics. (Q1882153)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Carlet, Claude}, On the secondary constructions of resilient and bent functions, 3-28 [Zbl 1062.94036] \textit{Kasami, Tadao}, Adaptive recursive MLD algorithm based on parallel concatenation decomposition for binary linear codes, 29-50 [Zbl 1059.94035] \textit{Li, Wen-Ching Winnie}, Modularity of asymptotically optimal towers of function fields, 51-65 [Zbl 1065.14027] \textit{Lu, Peizhong; Huang, Lianzhen}, A new correlation attack on LFSR sequences with high error tolerance, 67-83 [Zbl 1059.94014] \textit{Shokrollahi, Amin}, LDPC codes: an introduction, 85-110 [Zbl 1059.94025] \textit{Ding, Jintai; Schmidt, Dieter}, The new implementation schemes of the TTM cryptosystem are not secure, 113-127 [Zbl 1060.94017] \textit{Erez, Elona; Feder, Meir}, The capacity region of broadcast networks with two receivers, 129-137 [Zbl 1060.94007] \textit{Fu, Fangwei; Ling, San; Xing, Chaoping}, Constructions of nonbinary codes correcting \(t\)-symmetric errors and detecting all unidirectional errors: magnitude error criterion, 139-152 [Zbl 1077.94026] \textit{Gouget, Aline}, On the propagation criterion of Boolean functions, 153-168 [Zbl 1060.94020] \textit{Helleseth, Tor; Lahtonen, Jyrki; Rosendahl, Petri}, On certain equations over finite fields and cross-correlations of \(m\)-sequences, 169-176 [Zbl 1062.94029] \textit{Levy-dit-Vehel, Françoise; Perret, Ludovic}, A Polly Cracker system based on satisfiability, 177-192 [Zbl 1059.94017] \textit{Li, Jing}, Combinatorially designed LDPC codes using Zech logarithms and congruential sequences, 193-208 [Zbl 1059.94032] \textit{Li, Lei; Long, Shoulun}, New constructions of constant-weight codes, 209-222 [Zbl 1059.94042] \textit{Ling, San; Solé, Patrick}, Good self-dual quasi-cyclic codes over \(\mathbb{F}_q\), \(q\) odd, 223-226 [Zbl 1059.94029] \textit{Meidl, Wilfried}, Linear complexity and \(k\)-error linear complexity for \(p^n\)-periodic sequences, 227-235 [Zbl 1088.94014] \textit{Michon, Jean-Francis; Valarcher, Pierre; Yunès, Jean-Baptiste}, HFE and BDDs: a practical attempt at cryptanalysis, 237-246 [Zbl 1060.94023] \textit{Niederreiter, Harald}, Digital nets and coding theory, 247-257 [Zbl 1065.11057] \textit{Niederreiter, Harald; Özbudak, Ferruh}, Constructive asymptotic codes with an improvement on the Tsfasman-Vlăduţ-Zink and Xing bounds, 259-275 [Zbl 1072.94017] \textit{Pieprzyk, Josef; Wang, Huaxiong}, Malleability attacks on multi-party key agreement protocols, 277-288 [Zbl 1060.94024] \textit{Pinter, Charles C.}, Combinatorial tableaux in isoperimetry, 289-301 [Zbl 1054.05096] \textit{Tang, Yuansheng}, On the error exponents of reliability-order-based decoding algorithms for linear block codes, 303-317 [Zbl 1059.94037] \textit{Tian, Xiaojian; Ding, Cunsheng}, A construction of authentication codes with secrecy, 319-330 [Zbl 1059.94023] \textit{Tokushige, Hitoshi; Asatani, Jun; Fossorier, Marc P. C.; Kasami, Tadao}, Selection method of test patterns in soft-input and output iterative bounded distance decoding algorithm, 331-343 [Zbl 1059.94038] \textit{Wang, Yejing; McAven, Luke; Safavi-Naini, Reihaneh}, Deletion correcting using generalized Reed-Solomon codes, 345-358 [Zbl 1059.94041] \textit{Winterhof, Arne}, A note on the linear complexity profile of the discrete logarithm in finite fields, 359-367 [Zbl 1063.11052] \textit{Wu, Huapeng; Hasan, M. Anwar; Blake, Ian F.}, Speeding up RSA and elliptic curve systems by choosing suitable moduli, 369-383 [Zbl 1059.11075] \textit{Yao, Gang; Bao, Feng; Deng, Robert H.}, Security analysis of three oblivious transfer protocols, 385-396 [Zbl 1060.94028] \textit{Yao, Gang; Wang, Guilin; Wang, Yong}, An improved identification scheme, 397-405 [Zbl 1060.94029]