HWP : A new insight into canonical signed digitFEI XU; CHANG, Chip-Hong; JONG, Ching-Chuen et al.IEEE International Symposium on Circuits and Systems. 2004, pp 201-204, isbn 0-7803-8251-X, 4 p.Conference Paper

New distance defined from the hamming distanceMIYAGUCHI, S.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1986, Vol 69, Num 1, pp 4-5, issn 0387-236XArticle

Completely regular codesNEUMAIER, A.Discrete mathematics. 1992, Vol 106-7, pp 353-360, issn 0012-365XArticle

One-gapped q-gram filters for Levenshtein distanceBURKHARDT, Stefan; KÄRKKÄINEN, Juha.Lecture notes in computer science. 2002, pp 225-234, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Counting sequences with large local distanceCOHN, M.IEEE transactions on computers. 1985, Vol 34, Num 6, issn 0018-9340, 562Article

Distances sur les mots: application à la recherche de motifs = Distances on the words: application to the motives searchHEBRARD, Jean-Jacques.1984, 112 fThesis

On DC free magnetic recording codes generated by finite state machinesFERREIRA, H.IEEE transactions on magnetics. 1983, Vol 19, Num 6, pp 2691-2693, issn 0018-9464Article

Measuring Contour Degradation in Natural Image Utility Assessment: Methods and AnalysisPINTO, Guilherme O; ROUSE, David M; HEMAMI, Sheila S et al.Proceedings of SPIE, the International Society for Optical Engineering. 2011, Vol 7865, issn 0277-786X, isbn 0-8194-8402-4 978-0-8194-8402-4, 78650U.1-78650U.14Conference Paper

HCELP : Low bit rate speech coder for voice storage applicationsBOURAOUI, M; DRUILHE, F. B; FENG, G et al.International conference on acoustics, speech, and signal processing. 1997, pp 739-742, isbn 0-8186-7919-0Conference Paper

On FCSR Memory SequencesTIAN TIAN; QI, Wen-Feng.Lecture notes in computer science. 2006, pp 323-333, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 11 p.Conference Paper

MacWilliams Identity for Codes with the Rank MetricGADOULEAU, Maximilien; ZHIYUAN YAN.EURASIP Journal on wireless communications and networking. 2008, issn 1687-1472, ID754021.1-ID754021.13, NS-ADVANCES-IN-ERRORArticle

The number of edges in a subgraph of a Hamming graphSQUIER, R; TORRENCE, B; VOGT, A et al.Applied mathematics letters. 2001, Vol 14, Num 6, pp 701-705, issn 0893-9659Article

Random instance generation for MAX 3SATMOTOKI, Mitsuo.Lecture notes in computer science. 2001, pp 502-508, issn 0302-9743, isbn 3-540-42494-6Conference Paper

A method of examining Orchard codes for minimum hamming distance fiveOTTER, E. L; DEVRIES, R. C.IEEE transactions on communications. 1986, Vol 34, Num 4, pp 399-404, issn 0090-6778Article

NP-completeness of the hamming salesman problemERNVALL, J; KATAJAINEN, J; PENTTONEN, M et al.BIT (Nordisk Tidskrift for Informationsbehandling). 1985, Vol 25, Num 1, pp 289-292, issn 0006-3835Article

On Extracting Common Random Bits From Correlated Sources on Large AlphabetsSIU ON CHAN; MOSSEL, Elchanan; NEEMAN, Joe et al.IEEE transactions on information theory. 2014, Vol 60, Num 3, pp 1630-1637, issn 0018-9448, 8 p.Article

ON BLOCK CODES WITH SPECIFIED MAXIMUM DISTANCEREDDY SM.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 6; PP. 823-824; BIBL. 1 REF.Serial Issue

Generalized Hamming weights of Melas codes and dual Melas codesVAN DER GEER, G; VAN DER VLUGT, M.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 554-559, issn 0895-4801Article

On fault-tolerant networks for sortingYAO, A. C; YAO, F. F.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 120-128, issn 0097-5397Article

Generalized anticodes in hamming spacesAYDINIAN, H.General theory of information transfer and combinatorics. Lecture notes in computer science. sd, pp 1073-1074, issn 0302-9743, isbn 3-540-46244-9, 1Vol, 2 p.Book Chapter

Second support weights for binary self-dual codesSHIROMOTO, Keisuke.Lecture notes in computer science. 2006, pp 1-13, issn 0302-9743, isbn 3-540-35481-6, 1Vol, 13 p.Conference Paper

The rigidity of hamming spacesLEBEDEV, V. S.General theory of information transfer and combinatorics. Lecture notes in computer science. sd, pp 1093-1094, issn 0302-9743, isbn 3-540-46244-9, 1Vol, 2 p.Book Chapter

SYNTHESE D'UN CONVERTISSEUR LOGIQUE POUR AUTOMATES FINIS SANS PANNES AVEC UNE DISTANCE DE HAMMINGSAPOZHNIKOV VV; SAPOZHNIKOV VV; SAPOZHNIKOV VV; SAPOZHNIKOV VV; TROKHOV VG et al.1976; IZVEST. VYSSH. UCHEBN. ZAVED., ELEKTROMEKH.; S.S.S.R.; DA. 1976; NO 3; PP. 268-273; BIBL. 9 REF.Article

BORNE SUPERIEURE DE LA PUISSANCE DES CODES Q-NAIRESSIDORENKO VR.1975; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1975; VOL. 11; NO 3; PP. 14-20; BIBL. 2 REF.Article

BINARY CODES WITH DISJOINT CODEBOOKS AND MUTUAL HAMMING DISTANCE.GOODMAN RMF.1974; ELECTRON. LETTERS; G.B.; DA. 1974; VOL. 10; NO 18; PP. 390-391; BIBL. 2 REF.Article