Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    The Nonexistence of Ternary [50,5,32] Codes (1996)
    Springer
    Designs, codes and cryptography 7 (1996), S. 235-237 
    Details
    ISSN: 1573-7586
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is unknown (cf. Hill and Newton [8] or Hamada [3]) whether or not there exists a ternary [50,5,32] code meeting the Griesmer bound. The purpose of this paper is to prove the nonexistence of ternary [50,5,32] codes. Since there exists a ternary [51,5,32] code, this implies that n3(5,32) = 51, where n3(k,d) denotes the smallest value of n for which there exists a ternary [n,k,d] code.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018042823954
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...