A016119 Minimal number of cosets in an orthogonal sublattice of A_n (minimal number of paths in any trellis diagram).

1, 2, 2, 8, 8, 48, 16, 96, 128

Offset

1,2

References

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

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.

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

Links

Table of n, a(n) for n=1..9.

Crossrefs

Sequence in context: A325513 A144060 A230928 * A037223 A066988 A100384

Adjacent sequences: A016116 A016117 A016118 * A016120 A016121 A016122

Keyword

nonn

Author

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

Status

approved