Library

Language
Preferred search index
Number of Hits per Page
Default Sort Criterion
Default Sort Ordering
Size of Search History
Default Email Address
Default Export Format
Default Export Encoding
Facet list arrangement
Maximum number of values per filter
Auto Completion
Feed Format
Maximum Number of Items per Feed
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Designs, codes and cryptography 16 (1999), S. 5-9 
    ISSN: 1573-7586
    Keywords: binary linear codes ; quadratic residues ; norm quadratic residue codes ; covering radius
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In [5] Tiu and Wallace have constructed a new class of linear codes called Norm Quadratic Residue code C p for p〉 a prime of the form 4n+1 and determined some of its properties. It was shown that C p≤ p. He further conjectured that C p = p. In the present correspondence we show that similar construction works for primes of the form 4n-1. We further show that dim C p = p for any odd prime p and determine few elementary properties of these codes.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...