login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016120 Minimal number of cosets in an orthogonal sublattice of {A_n}* (minimal number of paths in any trellis diagram). 0
1, 2, 2, 8, 16, 48, 32, 48, 256 (list; graph; refs; listen; history; text; internal format)
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, p. 434.

LINKS

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

CROSSREFS

Sequence in context: A052970 A220589 A109190 * A188115 A085542 A239682

Adjacent sequences:  A016117 A016118 A016119 * A016121 A016122 A016123

KEYWORD

nonn

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 06:14 EST 2018. Contains 317162 sequences. (Running on oeis4.)