Login / Signup

Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes.

Yaron ShanyYair Be'ery
Published in: IEEE Trans. Inf. Theory (2000)
Keyphrases
  • square root
  • floating point
  • kalman filtering
  • arrival rate
  • euclidean space
  • kalman filter
  • machine learning
  • upper bound
  • probability density function
  • steady state