[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/isit/0001B18>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ali_Dehghan_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Amir_H._Banihashemi>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FISIT.2018.8437465>
foaf:homepage <https://doi.org/10.1109/ISIT.2018.8437465>
dc:identifier DBLP conf/isit/0001B18 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FISIT.2018.8437465 (xsd:string)
dcterms:issued 2018 (xsd:gYear)
rdfs:label From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ali_Dehghan_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Amir_H._Banihashemi>
swrc:pages 1640-1644 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/isit/2018>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/isit/0001B18/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/isit/0001B18>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/isit/isit2018.html#0001B18>
rdfs:seeAlso <https://doi.org/10.1109/ISIT.2018.8437465>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/isit>
dc:title From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document