guest ::
000237968 001__ 237968 000237968 005__ 20200313143111.0 000237968 0247_ $$2ISSN$$a0018-9448 000237968 0247_ $$2INSPEC$$a4761551 000237968 0247_ $$2WOS$$aWOS:A1994PA61100035 000237968 0247_ $$2DOI$$a10.1109/18.335909 000237968 0247_ $$2HSB$$a999910089982 000237968 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-0028429671 000237968 037__ $$aRWTH-CONV-086667 000237968 041__ $$aEnglish 000237968 1001_ $$0P:(DE-82)166301$$aFarkas, P.$$b0$$eAuthor 000237968 245__ $$aThree best binary linear block codes of minimum distance fifteen$$honline, print 000237968 260__ $$aPiscataway, NJ$$bIEEE$$c1994 000237968 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal 000237968 3367_ $$2DataCite$$aOutput Types/Journal article 000237968 3367_ $$00$$2EndNote$$aJournal Article 000237968 3367_ $$2BibTeX$$aARTICLE 000237968 3367_ $$2ORCID$$aJOURNAL_ARTICLE 000237968 3367_ $$2DRIVER$$aarticle 000237968 591__ $$aGermany 000237968 591__ $$aSlovakia 000237968 7001_ $$0P:(DE-82)166302$$aBrühl, Klaus$$b1$$eAuthor 000237968 773__ $$0PERI:(DE-600)2026365-X$$a10.1109/18.335909$$n3$$p949-951$$tIEEE transactions on information theory$$v40$$x0018-9448 000237968 909CO $$ooai:publications.rwth-aachen.de:237968$$pVDB 000237968 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article 000237968 9201_ $$0I:(DE-82)022000_20131231$$k022000$$lRechen- und Kommunikationszentrum$$x0 000237968 961__ $$c2014-02-12$$x2011-10-27$$z2012-02-20 000237968 970__ $$ahsb999910089982 000237968 980__ $$ajournal 000237968 980__ $$aI:(DE-82)022000_20131231 000237968 980__ $$aVDB 000237968 980__ $$aUNRESTRICTED 000237968 980__ $$aConvertedRecord