`a`
Advances in Mathematics of Communications (AMC)
 

Volume 5,Number 4,     November 2011

1

Error bounds for repeat-accumulate codes decoded via linear programming    Pages : 555 - 570

Idan Goldenberg and David Burshtein

 Abstract       References       Full Text      Related Articles

2

Codes over $\mathbb{Z}_{2^k}$, Gray map and self-dual codes    Pages : 571 - 588

Steven T. Dougherty and Cristina Fernández-Córdoba

 Abstract       References       Full Text      Related Articles

3

The merit factor of binary arrays derived from the quadratic character    Pages : 589 - 607

Kai-Uwe Schmidt

 Abstract       References       Full Text      Related Articles

4

On the number of bent functions from iterative constructions: lower bounds and hypotheses    Pages : 609 - 621

Natalia Tokareva

 Abstract       References       Full Text      Related Articles

5

Explicit formulas for real hyperelliptic curves of genus 2 in affine representation    Pages : 623 - 666

Stefan Erickson,  Michael J. Jacobson, Jr. and Andreas Stein

 Abstract       References       Full Text      Related Articles

6

Fast multi-sequence shift-register synthesis with the Euclidean algorithm    Pages : 667 - 680

Alexander Zeh and Antonia Wachter

 Abstract       References       Full Text      Related Articles

7

All binary linear codes of lengths up to 18 or redundancy up to 10 are normal    Pages : 681 - 686

Tsonka Baicheva

 Abstract       References       Full Text      Related Articles