Jump to content

Talk:Blahut–Arimoto algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 23:32, 14 January 2024 (Maintain {{WPBS}} and vital articles: 3 WikiProject templates. Keep majority rating "Start" in {{WPBS}}. Remove 3 same ratings as {{WPBS}} in {{Maths rating}}, {{WikiProject Computing}}, {{WikiProject Telecommunications}}. Remove 2 deprecated parameters: field, math-nested.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Is there a reference for this being hard in general to compute the constrained capacity? I know it's not true for the unconstrained capacity or for linear constraints. Aram.harrow (talk) 19:07, 22 February 2015 (UTC)[reply]