The linear programming bound for codes over finite Frobenius rings

MLA

Marcus Greferath, et al. “The Linear Programming Bound for Codes over Finite Frobenius Rings.” Designs, Codes and Cryptography, vol. 42, Feb. 2007. 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=edsair&AN=edsair.doi...........523175382f4666a0b5b01b52d851ccc6&authtype=sso&custid=ns315887.

APA

Marcus Greferath, Eimear Byrne, & Michael E. O’Sullivan. (2007). The linear programming bound for codes over finite Frobenius rings. Designs, Codes and Cryptography, 42.

Chicago

Marcus Greferath, Eimear Byrne, and Michael E. O’Sullivan. 2007. “The Linear Programming Bound for Codes over Finite Frobenius Rings.” Designs, Codes and Cryptography 42 (February). 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=edsair&AN=edsair.doi...........523175382f4666a0b5b01b52d851ccc6&authtype=sso&custid=ns315887.