The SCEAS System
Navigation Menu

Conferences in DBLP

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC) (aaecc)
1999 (conf/aaecc/1999)

  1. G. David Forney Jr.
    Codes on Graphs: A Survey for Algebraists. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:1-9 [Conf]
  2. Hui Jin, Robert J. McEliece
    RA Codes Achieve AWGN Channel Capacity. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:10-18 [Conf]
  3. Ezra Miller, Bernd Sturmfels
    Monomial Ideals and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:19-28 [Conf]
  4. Michael Clausen, Meinard Müller
    A Fast Program Generator of Fast Fourier Transforms. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:29-42 [Conf]
  5. Tadao Kasami
    On Integer Programming Problems Related to Soft-Decision Iterative Decoding Algorithms. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:43-54 [Conf]
  6. Ian F. Blake
    Curves with Many Points and Their Applications. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:55-64 [Conf]
  7. Mohammad Amin Shokrollahi
    New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:65-76 [Conf]
  8. Karin Engdahl, Michael Lentmaier, Kamil Sh. Zigangirov
    On the Theory of Low-Density Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:77-86 [Conf]
  9. Frances Griffin, Harald Niederreiter, Igor Shparlinski
    On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:87-93 [Conf]
  10. Claude Carlet, Philippe Guillot
    A New Representation of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:94-103 [Conf]
  11. I. Vaughan, L. Clarkson
    An Algorithm to Compute a Nearest Point in the Lattice An*. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:104-120 [Conf]
  12. Kathy J. Horadam
    Sequences from Cycles. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:121-130 [Conf]
  13. Wende Chen, Torleiv Kløve
    On the Second Greedy Weight for Binary Linear Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:131-141 [Conf]
  14. Uri Blass, Iiro S. Honkala, Simon Litsyn
    On tHe Size of Identifying Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:142-147 [Conf]
  15. Markus Püschel, Martin Rötteler, Thomas Beth
    Fast Quantum Fourier Transforms for a Class of Non-Abelian Groups. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:148-159 [Conf]
  16. Marcus Greferath, Stefan E. Schmidt
    Linear Codes and Rings of Matrices. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:160-169 [Conf]
  17. Mahesh C. Bhandari, Manish K. Gupta, Arbind K. Lal
    On Z4-Simplex Codes and Their Gray Images. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:170-180 [Conf]
  18. Martin Bossert, Helmut Grießer, Johannes Maucher, Victor V. Zyablov
    Some Results on Generalized Concatenation of Block Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:181-190 [Conf]
  19. Qi Wang, Lei Wei, Rodney A. Kennedy
    Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:191-200 [Conf]
  20. Yuansheng Tang, Tadao Kasami, Toru Fujiwara
    An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:201-210 [Conf]
  21. Elena Couselo, Santos González, Viktor T. Markov, Alexander A. Nechaev
    Recursive MDS-Codes and Pseudogeometries. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:211-220 [Conf]
  22. Hidema Tanaka, Kazuyuki Hisamatsu, Toshinobu Kaneko
    Strenght of MISTY1 without FL Function for Higher Order Differential Attack. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:221-230 [Conf]
  23. Markus Grassl, Willi Geiselmann, Thomas Beth
    Quantum Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:231-244 [Conf]
  24. Zsigmond Nagy, Kenneth Zeger
    Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:245-251 [Conf]
  25. Vladimir Sidorenko, Johannes Maucher, Martin Bossert
    Rectangular Codes and Rectangular Algebra. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:252-259 [Conf]
  26. Tom Høholdt, Rasmus Refslund Nielsen
    Decoding Hermitian Codes with Sudan's Algorithm. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:260-270 [Conf]
  27. Ryutaroh Matsumoto, Shinji Miura
    Computing a Basis of L(D) on an Affine Algebraic Curve with One Rational Place at Infinity. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:271-281 [Conf]
  28. Marc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai
    Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:282-293 [Conf]
  29. Shengli Liu, Yumin Wang
    An Authetnication Scheme over Non-Authentic Public Channel in Information-Theoretic Secret-Key Agreement. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:294-301 [Conf]
  30. Shojiro Sakata, Masazumi Kurihara
    A Systolic Array Architecture for Fast Decoding of One-Point AG Codes and Scheduling of Parallel Processing on It. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:302-313 [Conf]
  31. Mehul Motani, Chris Heegard
    Computing Weight Distributions of Convolutional Codes via Shift Register Synthesis. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:314-323 [Conf]
  32. Didier Le Ruyet, Hong Sun, Han Vu Thien
    Properties of Finite Response Input Sequences of Recursive Convolutional Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:324-333 [Conf]
  33. K. K. P. Chanduka, Mahesh C. Bhandari, Arbind K. Lal
    Lower Bounds for Group Covering Designs. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:334-345 [Conf]
  34. Garry Hughes
    Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:346-354 [Conf]
  35. Faramarz Fekri, Steven W. McLaughlin, Russell M. Mersereau, Ronald W. Schafer
    Double Circulant Self-Dual Codes Using Finite-Field Wavelet Transforms. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:355-364 [Conf]
  36. V. L. Kurakin, Alexey S. Kuzmin, Viktor T. Markov, Alexander V. Mikhalev, Alexander A. Nechaev
    Linear Codes and Polylinear Recurrences over Finite Rings and Modules. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:365-391 [Conf]
  37. Jörn Müller-Quade, Thomas Beth
    Calculating Generators for Invariant Fields of Linear Algebraic Groups. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:392-403 [Conf]
  38. Joachim von zur Gathen, Igor Shparlinski
    Constructing Elements of Large Order in Finite Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:404-409 [Conf]
  39. Serdar Boztas
    New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:410-419 [Conf]
  40. Matthew G. Parker
    Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:420-429 [Conf]
  41. Bernard Mourrain
    A New Criterion for Normal Form Algorithms. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:430-443 [Conf]
  42. Alain Poli, M. C. Gennero, D. Xin
    Discrete Fourier Transform and Gröbner Bases. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:444-453 [Conf]
  43. Sylvia B. Encheva, Gérard D. Cohen
    On the State Complexities of Ternary Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:454-461 [Conf]
  44. Koichi Betsumiya, T. Aaron Gulliver, Masaaki Harada
    Binary Optimal Linear Rate 1/2 Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:462-471 [Conf]
  45. Patric R. J. Östergård
    On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:472-481 [Conf]
  46. James W. Bond, Stefan Hui, Hank Schmidt
    The Euclidean Algorithm and Primitive Polypomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:482-491 [Conf]
  47. Marek Karpinski, Igor Shparlinski
    On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:492-497 [Conf]
  48. Alper Halbutogullari, Çetin Kaya Koç
    Mastrovito Multiplier for General Irreducible Polynomials. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:498-507 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002