 | 2009 |
| 13 |  | Alex Alvarado,
Erik Agrell,
Arne Svensson:
On the capacity of BICM with QAM constellations.
IWCMC 2009: 573-579 |
| 12 |  | Arash Ghasemmehdi,
Erik Agrell:
Optimal Projection Method in Sphere Decoding
CoRR abs/0906.0249: (2009) |
| 2007 |
| 11 |  | Erik Agrell,
Johan Lassing,
Erik G. Ström,
Tony Ottosson:
Gray Coding for Multilevel Constellations in Gaussian Noise.
IEEE Transactions on Information Theory 53(1): 224-235 (2007) |
| 2005 |
| 10 |  | Hans R. Künsch,
Erik Agrell,
Fred A. Hamprecht:
Optimal lattices for sampling.
IEEE Transactions on Information Theory 51(2): 634-647 (2005) |
| 2004 |
| 9 |  | Matts-Ola Wessman,
Arne Svensson,
Erik Agrell:
Frequency diversity performance of coded multiband-OFDM systems on IEEE UWB channels.
VTC Fall (2) 2004: 1197-1201 |
| 8 |  | Erik Agrell,
Johan Lassing,
Erik G. Ström,
Tony Ottosson:
On the optimality of the binary reflected Gray code.
IEEE Transactions on Information Theory 50(12): 3170-3182 (2004) |
| 2002 |
| 7 |  | Erik Agrell,
Thomas Eriksson,
Alexander Vardy,
Kenneth Zeger:
Closest point search in lattices.
IEEE Transactions on Information Theory 48(8): 2201-2214 (2002) |
| 2001 |
| 6 |  | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
A table of upper bounds for binary codes.
IEEE Transactions on Information Theory 47(7): 3004-3006 (2001) |
| 2000 |
| 5 |  | Erik Agrell,
Alexander Vardy,
Kenneth Zeger:
Upper bounds for constant-weight codes.
IEEE Transactions on Information Theory 46(7): 2373-2395 (2000) |
| 1998 |
| 4 |  | Erik Agrell,
Thomas Eriksson:
Optimization of Lattices for Quantization.
IEEE Transactions on Information Theory 44(5): 1814-1828 (1998) |
| 3 |  | Erik Agrell:
On the Voronoi Neighbor Ratio for Binary Linear Block Codes.
IEEE Transactions on Information Theory 44(7): 3064-3072 (1998) |
| 1996 |
| 2 |  | Erik Agrell:
Voronoi regions for binary linear block codes.
IEEE Transactions on Information Theory 42(1): 310-316 (1996) |
| 1 |  | P. Knagenhjelm,
Erik Agrell:
The Hadamard transform-a tool for index assignment.
IEEE Transactions on Information Theory 42(4): 1139-1151 (1996) |