✦ LIBER ✦

Minimum distance and optimal transformations on SO(N)

✍ Scribed by Andrew J. Sinclair; John E. Hurtado; John L. Junkins

Publisher: Springer Netherlands
Year: 2007
Tongue: English
Weight: 264 KB
Volume: 54
Category: Article
ISSN: 0924-090X
DOI: 10.1007/s11071-007-9319-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on minimum distance estimates

✍ Constantine A. Drossos; Andreas N. Philippou 📂 Article 📅 1980 🏛 Springer Japan 🌐 English ⚖ 110 KB

On minimum Hellinger distance estimation

✍ Jingjing Wu; Rohana J. Karunamuni 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 French ⚖ 400 KB

On Tanner Codes: Minimum Distance and De

On Tanner Codes: Minimum Distance and Decoding

✍ H. Janwa; A. K. Lal 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 111 KB

Optimal Computing the Chessboard Distanc

Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

✍ Yu-Hua Lee; Shi-Jinn Horng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 290 KB

The distance transform (DT) is an image computation tool which can be used to extract the information about the shape and the position of the foreground pixels relative to each other. It converts a binary image into a grey-level image, where each pixel has a value corresponding to the distance to th

On reachability and minimum cost optimal

On reachability and minimum cost optimal control

✍ John Lygeros 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 387 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po