Applied algebra, algebraic algorithms and error correcting codes. 13th international symposium, AAECC-13, Honolulu, HI, USA, November 15--19, 1999. Proceedings (Q1960338)

The articles of this volume will be reviewed individually. The 1995 symposium (11th) has been indicated (see Zbl 0847.00060). Indexed articles: \textit{Forney, G. David jun.}, Codes on graphs: A survey for algebraists, 1-9 [Zbl 0954.94023] \textit{Jin, Hui; McEliece, Robert J.}, RA codes achieve AWGN channel capacity, 10-18 [Zbl 0989.94504] \textit{Miller, Ezra; Sturmfels, Bernd}, Monomial ideals and planar graphs, 19-28 [Zbl 0957.13022] \textit{Clausen, Michael; Müller, Meinard}, A fast program generator of fast Fourier transforms, 29-42 [Zbl 0976.20010] \textit{Kasami, Tadao}, On integer programming problems related to soft-decision iterative decoding algorithms, 43-54 [Zbl 0981.94059] \textit{Blake, Ian F.}, Curves with many points and their applications, 55-64 [Zbl 0981.94023] \textit{Shokrollahi, M. Amin}, New sequences of linear time erasure codes approaching the channel capacity, 65-76 [Zbl 0981.94067] \textit{Engdahl, Karin; Lentmaier, Michael; Zigangirov, Kamil Sh.}, On the theory of low-density convolutional codes, 77-86 [Zbl 0954.94021] \textit{Griffin, Frances; Niederreiter, Harald; Shparlinski, Igor E.}, On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders, 87-93 [Zbl 0958.11052] \textit{Carlet, Claude; Guillot, Philippe}, A new representation of Boolean functions, 94-103 [Zbl 0979.94040] \textit{Vaughan, I.; Clarkson, L.}, An algorithm to compute a nearest point in the lattice \(A_n^*\), 104-120 [Zbl 1001.11028] \textit{Horadam, K. J.}, Sequences from cocycles, 121-130 [Zbl 0981.94008] \textit{Chen, Wende; Kløve, Torleiv}, On the second greedy weight for binary linear codes, 131-141 [Zbl 0981.94049] \textit{Blass, Uri; Honkala, Iiro; Litsyn, Simon}, On the size of identifying codes, 142-147 [Zbl 0981.94048] \textit{Püschel, Markus; Rötteler, Martin; Beth, Thomas}, Fast quantum Fourier transforms for a class of non-abelian groups, 148-159 [Zbl 1050.81519] \textit{Greferath, M.; Schmidt, S. E.}, Linear codes and rings of matrices, 160-169 [Zbl 0989.94029] \textit{Bhandari, Mahesh C.; Gupta, Manish K.; Lal, Arbind K.}, On \(\mathbb{Z}_4\)-simplex codes and their Gray images, 170-180 [Zbl 0991.94052] \textit{Bossert, M.; Grießer, H.; Maucher, J.; Zyablov, V. V.}, Some results on generalized concatenation of block codes, 181-190 [Zbl 0953.94037] \textit{Wang, Qi; Wei, Lei; Kennedy, Rodney A.}, Near optimal decoding for TCM using the BIVA and trellis shaping, 191-200 [Zbl 1038.94566] \textit{Tang, Yuansheng; Kasami, Tadao; Fujiwara, Toru}, An optimality testing algorithm for a decoded codeword of binary block codes and its computational complexity, 201-210 [Zbl 0985.94053] \textit{Couselo, Elena; Gonzalez, Santos; Markov, Victor; Nechaev, Alexandr}, Recursive MDS-codes and pseudogeometries, 211-220 [Zbl 0981.94066] \textit{Tanaka, Hidema; Hisamatsu, Kazuyuki; Kaneko, Toshinobu}, Strength of MISTY1 without FL function for higher order differential attack, 221-230 [Zbl 0979.94042] \textit{Grassl, Markus; Geiselmann, Willi; Beth, Thomas}, Quantum Reed-Solomon codes, 231-244 [Zbl 0979.94050] \textit{Nagy, Zsigmond; Zeger, Kenneth}, Capacity bounds for the 3-dimensional (0,1) runlength limited channel, 245-251 [Zbl 0953.94015] \textit{Sidorenko, V.; Maucher, J.; Bossert, M.}, Rectangular codes and rectangular algebra, 252-259 [Zbl 0979.94051] \textit{Høholdt, T.; Nielsen, R. Refslund}, Decoding Hermitian codes with Sudan's algorithm, 260-270 [Zbl 0953.94035] \textit{Matsumoto, Ryutaroh; Miura, Shinji}, Computing a basis of \({\mathfrak L} (D)\) on an affine algebraic curve with one rational place at infinity, 271-281 [Zbl 0958.14041] \textit{Fossorier, Marc P. C.; Mihaljević, Miodrag J.; Imai, Hideki}, Critical noise for convergence of iterative probabilistic decoding with belief propagation in cryptographic applications, 282-293 [Zbl 0953.94021] \textit{Liu, Shengli; Wang, Yumin}, An authentication scheme over non-authentic public channel in information-theoretic secret-key agreement, 294-301 [Zbl 0988.94519] \textit{Sakata, Shojiro; Kurihara, Masazumi}, A systolic array architecture for fast decoding of one-point AG codes and scheduling of parallel processing on it, 302-313 [Zbl 0983.94049] \textit{Motani, Mehul; Heegard, Chris}, Computing weight distributions of convolutional codes via shift register synthesis, 314-323 [Zbl 0985.94045] \textit{Le Ruyet, Didier; Sun, Hong; Han Vu Thien}, Properties of finite response input sequences of recursive convolutional codes, 324-333 [Zbl 0985.94044] \textit{Chanduka, K. K. P.; Bhandari, Mahesh C.; Lal, Arbind K.}, Lower bounds for group covering designs, 334-345 [Zbl 0956.05019] \textit{Hughes, Garry}, Characteristic functions of relative difference sets, correlated sequences and Hadamard matrices, 346-354 [Zbl 0956.05025] \textit{Fekri, F.; McLaughlin, S. W.; Mersereau, R. M.; Schafer, R. W.}, Double circulant self-dual codes using finite-field wavelet transforms, 355-364 [Zbl 0986.94509] \textit{Kurakin, V. L.; Kuzmin, A. S.; Markov, V. T.; Mikhalev, A. V.; Nechaev, A. A.}, Linear codes and polylinear recurrences over finite rings and modules (a survey), 365-391 [Zbl 0986.94034] \textit{Müller-Quade, Jörn; Beth, Thomas}, Calculating generators for invariant fields of linear algebraic groups, 392-403 [Zbl 0959.14029] \textit{von zur Gathen, Joachim; Shparlinski, Igor}, Constructing elements of large order in finite fields, 404-409 [Zbl 0985.11067] \textit{Boztaş, Serdar}, New lower bounds on the periodic crosscorrelation of QAM codes with arbitrary energy, 410-419 [Zbl 1010.94548] \textit{Parker, Matthew G.}, Conjectures on the size of constellations constructed from direct sums of PSK kernels, 420-429 [Zbl 1016.94510] \textit{Mourrain, B.}, A new criterion for normal form algorithms, 430-443 [Zbl 0976.12005] \textit{Poli, A.; Gennero, M. C.; Xin, D.}, Discrete Fourier transform and Gröbner bases, 444-453 [Zbl 0953.94034] \textit{Encheva, Sylvia; Cohen, Gérard}, On the state complexities of ternary codes, 454-461 [Zbl 0989.94523] \textit{Betsumiya, Koichi; Gulliver, T. Aaron; Harada, Masaaki}, Binary optimal linear rate \(1/2\) codes, 462-471 [Zbl 0986.94508] \textit{Östergård, Patric R. J.}, On binary/ternary error-correcting codes with minimum distance 4, 472-481 [Zbl 0986.94046] \textit{Bond, James W.; Hui, Stefen; Schmidt, Hank}, The Euclidean algorithm and primitive polynomials over finite fields, 482-491 [Zbl 0973.11104] \textit{Karpinski, Marek; Shparlinski, Igor}, On the computational hardness of testing square-freeness of sparse polynomials, 492-497 [Zbl 0973.11105] \textit{Halbutoǧulları, A.; Koç, Ç. K.}, Mastrovito multiplier for general irreducible polynomials, 498-507 [Zbl 0976.94018]