login
Minimal number of cosets in an orthogonal sublattice of {A_n}* (minimal number of paths in any trellis diagram).
0

%I #4 Jun 12 2004 03:00:00

%S 1,2,2,8,16,48,32,48,256

%N Minimal number of cosets in an orthogonal sublattice of {A_n}* (minimal number of paths in any trellis diagram).

%D A. H. Banihashemi, Decoding complexity and trellis structure of lattices, Ph.D. dissertation, E&CE Dept., Univ. of Waterloo, Waterloo, Ont., Canada, 1997.

%D A. H. Banihashemi and I. F. Blake, On the trellis complexity of root lattices and their duals, IEEE Trans. Inform. Theory 45 (1999), no. 6, 2168-2172.

%D A. H. Banihashemi and I. F. Blake, Minimal trellis diagrams of lattices, Proc. IEEE International Symp. on Inform. Theory, Ulm, Germany, p. 434.

%K nonn

%O 1,2

%A Amir H. Banihashemi (ahashemi(AT)shannon.uwaterloo.ca)