[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/dcc/Meidl04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Wilfried_Meidl>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1023%2FB%3ADESI.0000035466.28660.e9>
foaf:homepage <https://doi.org/10.1023/B:DESI.0000035466.28660.e9>
dc:identifier DBLP journals/dcc/Meidl04 (xsd:string)
dc:identifier DOI doi.org%2F10.1023%2FB%3ADESI.0000035466.28660.e9 (xsd:string)
dcterms:issued 2004 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/dcc>
rdfs:label How Many Bits have to be Changed to Decrease the Linear Complexity?. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Wilfried_Meidl>
swrc:number 2 (xsd:string)
swrc:pages 109-122 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/dcc/Meidl04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/dcc/Meidl04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/dcc/dcc33.html#Meidl04>
rdfs:seeAlso <https://doi.org/10.1023/B:DESI.0000035466.28660.e9>
dc:subject stream ciphers; linear complexity; k-error linear complexity; algorithm; periodic sequences (xsd:string)
dc:title How Many Bits have to be Changed to Decrease the Linear Complexity?. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 33 (xsd:string)