On The Classification of Binary Optimal Self-Orthogonal CodesRUIHU LI; ZONGBEN XU; XUEJUN ZHAO et al.IEEE transactions on information theory. 2008, Vol 54, Num 8, pp 3778-3782, issn 0018-9448, 5 p.Article

The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four : A Complete SolutionYEOW MENG CHEE; SON HOANG DAU; LING, Alan C. H et al.IEEE transactions on information theory. 2008, Vol 54, Num 3, pp 1291-1295, issn 0018-9448, 5 p.Article

Some results for linear binary codes with minimum distance 5 and 6BOUYUKLIEV, Iliya; VARBANOV, Zlatko.IEEE transactions on information theory. 2005, Vol 51, Num 12, pp 4387-4391, issn 0018-9448, 5 p.Article

Is every compact code Huffman ?WOOD, J. H.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 297-299, issn 0012-365XArticle

ES GIBT KEINEN OPTIMALEN (N+2,3). CODE EINER UNGERADEN ORANUNGN = IL N'EXISTE PAS DE CODE OPTIMAL (N+2,3) D'ORDRE N IMPAIRHEISE W.1978; MATH. Z.; DEU; DA. 1978; VOL. 164; NO 1; PP. 67-68; BIBL. 3 REF.Article

UEBER DIE MAXIMALE BLOCKLAENGE OPTIMALER CODES = SUR LA LONGUEUR BLOC MAXIMALE DE CODES OPTIMAUXHEISE W.1979; SER. INTERNATION. ANAL. NUMER.; CHE; DA. 1979; VOL. 46; PP. 128-134; BIBL. 6 REF.Conference Paper

Optimal Constant Weight CodesGASHKOV, Igor.Lecture notes in computer science. 2006, pp 912-915, issn 0302-9743, isbn 3-540-34379-2, 4 p.Conference Paper

Combinatorial constructions of optimal constant-composition codesCUNSHENG DING; JIANXING YIN.IEEE transactions on information theory. 2005, Vol 51, Num 10, pp 3671-3674, issn 0018-9448, 4 p.Article

A new class of optimal optical orthogonal codes with weight fiveSHIKUI MA; YANXUN CHANG.IEEE transactions on information theory. 2004, Vol 50, Num 8, pp 1848-1850, issn 0018-9448, 3 p.Article

Optimal quantization in neural codingMCDONNELL, Mark; ABBOTT, Derek.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 494Conference Paper

Optimal optical orthogonal codes with λ > 1OMRANI, Reza; MORENO, Oscar; VIJAY KUMAR, P et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 366Conference Paper

Four nonexistence results for ternary linear codesVAN EUPEN, M.IEEE transactions on information theory. 1995, Vol 41, Num 3, pp 800-805, issn 0018-9448Article

Optimum codes of dimension 3 and 4 over GF(4)BHANDARI, M. C; GARG, M. S.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1564-1567, issn 0018-9448Article

Optimal feedback schemes over unknown channelsTCHAMKERTEN, Asian; TELATAR, Emre I.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 379Conference Paper

Optimal double circulant Z₄-CodesGULLIVER, T. Aaron; HARADA, Masaaki.Lecture notes in computer science. 2001, pp 122-128, issn 0302-9743, isbn 3-540-42911-5Conference Paper

On robust identification in the square and king gridsLAIHONEN, Tero.Discrete applied mathematics. 2006, Vol 154, Num 17, pp 2499-2510, issn 0166-218X, 12 p.Article

OPTIMAL CODES, N-ARCS AND LAGUERRE GEOMETRY.HEISE W.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 403-406; BIBL. 5 REF.Article

CLASSES D'HEREDITE ET CODAGE DE GRAPHESALEKSEEV VE.1982; PROBLEMY KIBERNETIKI; ISSN 507989; SUN; DA. 1982; NO 39; PP. 151-164; BIBL. 11 REF.Article

AN EFFICIENT ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL PREFIX CODESMEHLHORN K.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 5; PP. 513-517; BIBL. 8 REF.Article

SUR LES METHODES D'ALLONGEMENT DES CODESZINOV'EV VA; LITSYN SN.1982; PROBLEMY PEREDACI INFORMACII; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 6; PP. 29-42; BIBL. 13 REF.Article

On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16ÖSTERGARD, Patric R. J.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6824-6826, issn 0018-9448, 3 p.Article

The effect of synchronization codes on system design parametersKUNDAELI, H. N.International journal of electronics. 1996, Vol 80, Num 6, pp 693-701, issn 0020-7217Article

Linear codes with complementary dualsMASSEY, J. L.Discrete mathematics. 1992, Vol 106-7, pp 337-342, issn 0012-365XArticle

On the competitive optimality of Huffman codesCOVER, T. M.IEEE transactions on information theory. 1991, Vol 37, Num 1, pp 172-174, issn 0018-9448, 3 p.Article

Bit probabilities of optimal binary source codesMONTGOMERY, B. L; DIAMOND, H; VIJAYA KUMAR, B. V. K et al.IEEE transactions on information theory. 1990, Vol 36, Num 6, pp 1446-1450, issn 0018-9448Article