On the intractability of permuting a block code to minimize trellis complexity

MLA

Horn, Gavin B., and Frank R. Kschischang. “On the Intractability of Permuting a Block Code to Minimize Trellis Complexity.” IEEE Transactions on Information Theory, vol. v42, no. n6, Nov. 1996, p. 2042. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsggo&AN=edsgcl.19132238&authtype=sso&custid=ns315887.

APA

Horn, G. B., & Kschischang, F. R. (1996). On the intractability of permuting a block code to minimize trellis complexity. IEEE Transactions on Information Theory, v42(n6), 2042.

Chicago

Horn, Gavin B., and Frank R. Kschischang. 1996. “On the Intractability of Permuting a Block Code to Minimize Trellis Complexity.” IEEE Transactions on Information Theory v42 (n6): 2042. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsggo&AN=edsgcl.19132238&authtype=sso&custid=ns315887.