default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdvances in Mathematics of Communications, Volume 2
Volume 2, Number 1, February 2008
- Alexei Kaltchenko, Nina Timofeeva:
Entropy estimators with almost sure convergence and an O(n-1) variance. 1-13 - Maria Bras-Amorós
, Michael E. O'Sullivan:
Duality for some families of correction capability optimized evaluation codes. 15-33 - David Grant, Mahesh K. Varanasi:
Duality theory for space-time codes over finite fields. 35-54 - Heide Gluesing-Luerssen, Fai-Lung Tsang:
A matrix ring description for cyclic convolutional codes. 55-81 - Sergio Estrada, Juan Ramón García-Rozas, Justo Peralta, E. Sánchez-García:
Group convolutional codes. 83-94 - Marcelo Muniz Silva Alves, Luciano Panek, Marcelo Firer:
Error-block codes and poset metrics. 95-111
Volume 2, Number 2, May 2008
- Konstantinos Drakakis, Scott Rickard:
On the generalization of the Costas property in the continuum. 113-130 - David Grant, Mahesh K. Varanasi:
The equivalence of space-time codes and codes defined over finite fields and Galois rings. 131-145 - Ernst M. Gabidulin, Pierre Loidreau:
Properties of subspace subcodes of Gabidulin codes. 147-157 - Pradeep Kumar Mishra, Vassil S. Dimitrov:
A combinatorial interpretation of double base number system and some consequences. 159-173 - Carlos Munuera, Fernando Torres:
A note on the order bound on the minimum distance of AG codes and acute semigroups. 175-181 - Alexis De Vos, Yvan Van Rentergem:
Young subgroups for reversible computers. 183-200 - Claude Carlet, Khoongming Khoo, Chu-Wee Lim, Chuan-Wen Loe:
On an improved correlation analysis of stream ciphers using multi-output Boolean functions and the related generalized notion of nonlinearity. 201-221 - Olof Heden:
A survey of perfect codes. 223-247
Volume 2, Number 3, August 2008
- Andreas Klein:
How to say yes, no and maybe with visual cryptography. 249-259 - Jan De Beule, Klaus Metsch, Leo Storme:
Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound. 261-272 - Delphine Boucher, Patrick Solé, Felix Ulmer:
Skew constacyclic codes over Galois rings. 273-292 - Felix Fontein:
Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures. 293-307 - W. Cary Huffman:
Additive cyclic codes over F4. 309-343 - John B. Little:
Erratum. 344-345
Volume 2, Number 4, November 2008
- Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal:
Zig-zag and replacement product graphs and LDPC codes. 347-372 - Axel Heim, Vladimir Sidorenko, Uli Sorger:
Computation of distributions and their moments in the trellis. 373-391 - Bram van Asch, Frans Martens:
Lee weight enumerators of self-dual codes and theta functions. 393-402 - Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. 403-420 - Joan-Josep Climent, Francisco J. García, Verónica Requena:
On the construction of bent functions of n+2 variables from bent functions of n variables. 421-431 - Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution and decoding of codes on hypergraphs. 433-450 - T. L. Alderson, Keith E. Mellinger:
Geometric constructions of optimal optical orthogonal codes. 451-467
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 2025-11-23 19:43 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:
