Publikation: Fast and Flexible CRC Calculation
Lade...
Dateien
Datum
2004
Autor:innen
Doering, Andreas
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
IEE Electronics Letters. 2004, 40(1), pp. 10-11. Available under: doi: 10.1049/el:20040032
Zusammenfassung
An algorithm for software or hardware implementation is presented, allowing fast computation of Cyclic Redundancy Checks with arbitrary polynomials and a high flexibility, such as updating of checksums after modifying data block parts with a known old checksum.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Cyclic Redundancy Check, Network processing
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
DOERING, Andreas, Marcel WALDVOGEL, 2004. Fast and Flexible CRC Calculation. In: IEE Electronics Letters. 2004, 40(1), pp. 10-11. Available under: doi: 10.1049/el:20040032BibTex
@article{Doering2004Flexi-6420,
year={2004},
doi={10.1049/el:20040032},
title={Fast and Flexible CRC Calculation},
number={1},
volume={40},
journal={IEE Electronics Letters},
pages={10--11},
author={Doering, Andreas and Waldvogel, Marcel}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/6420">
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6420/1/doering04fast.pdf"/>
<dc:creator>Doering, Andreas</dc:creator>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/6420/1/doering04fast.pdf"/>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dcterms:bibliographicCitation>First publ. in: IEE Electronics Letters, 40 (2004),1 pp. 10-11</dcterms:bibliographicCitation>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dc:language>eng</dc:language>
<dcterms:abstract xml:lang="eng">An algorithm for software or hardware implementation is presented, allowing fast computation of Cyclic Redundancy Checks with arbitrary polynomials and a high flexibility, such as updating of checksums after modifying data block parts with a known old checksum.</dcterms:abstract>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:37Z</dc:date>
<dc:creator>Waldvogel, Marcel</dc:creator>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:format>application/pdf</dc:format>
<dc:contributor>Doering, Andreas</dc:contributor>
<dc:contributor>Waldvogel, Marcel</dc:contributor>
<dc:rights>terms-of-use</dc:rights>
<dcterms:title>Fast and Flexible CRC Calculation</dcterms:title>
<dcterms:issued>2004</dcterms:issued>
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/6420"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:12:37Z</dcterms:available>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
