Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A016120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A016120 Minimal number of cosets in an orthogonal sublattice of {A_n}* (minimal number of paths in any trellis diagram). +0
1
1, 2, 2, 8, 16, 48, 32, 48, 256 (list; graph; listen)
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.

CROSSREFS

Sequence in context: A098273 A052970 A109190 this_sequence A085542 A009725 A053098

Adjacent sequences: A016117 A016118 A016119 this_sequence A016121 A016122 A016123

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research