✦ LIBER ✦

On Minimal Tree Realizations of Linear Codes

✍ Scribed by Kashyap, N.

Book ID: 114641735
Publisher: IEEE
Year: 2009
Tongue: English
Weight: 486 KB
Volume: 55
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2009.2023718

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal linear realizations of autonomou

Minimal linear realizations of autonomous automata

✍ Wolffried Stucky; Hermann Walter 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 605 KB

Codes on graphs: constraint complexity o

Codes on graphs: constraint complexity of cycle-free realizations of linear codes

✍ Forney, G.D., Jr. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 783 KB

Constraint Complexity of Realizations of

Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs

✍ Kashyap, N. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 368 KB

Minimal Realizations of Linear Systems:

Minimal Realizations of Linear Systems: The “Shortest Basis” Approach

✍ Forney, G.D. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 262 KB

Convex Realizations of Planar Linear Tre

Convex Realizations of Planar Linear Trees

✍ N. S. Gusev 📂 Article 📅 2003 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 166 KB

Minimal order realizations for a class o

Minimal order realizations for a class of positive linear systems

✍ Lorenzo Farina 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 325 KB

The positive realization problem for linear systems is to find, for a given transfer function, all possible realizations with a state spaee of minimal dimension such that the resulting system is a positive system. In this paper, discrete-time positive linear systems having the nonnegative orthant re