kw.\*:("Minimal distance")
Results 1 to 25 of 1534
Selection :
Turbo codes with modified Welch-Costas interleaversTRIFINA, Lucian; MUNTEANU, Valeriu; TARNICERIU, Daniela et al.Annales des télécommunications. 2007, Vol 62, Num 9-10, pp 1045-1052, issn 0003-4347, 8 p.Article
New construction for classes of majority logic decodable codes with even minimum distancesCHEN ZHI; FAN PINGZHI; JIN FAN et al.Electronics Letters. 1991, Vol 27, Num 7, pp 549-550, issn 0013-5194, 2 p.Article
Codes Defined by Forms of Degree 2 on Quadric SurfacesEDOUKOU, Frédéric A. B.IEEE transactions on information theory. 2008, Vol 54, Num 2, pp 860-864, issn 0018-9448, 5 p.Article
Distances minimales et distances idéales = Minimal distances and ideal distancesRIO, E.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 326, Num 9, pp 1127-1130, issn 0764-4442Article
On the minimum distance of ternary cyclic codesVAN EUPEN, M; VAN LINT, J. H.IEEE transactions on information theory. 1993, Vol 39, Num 2, pp 409-422, issn 0018-9448Article
Measurement of overhead line electrical clearances of importance to the safety of personsSPARROW, L. J; BLACKETT, J. J; JOHNSTONE, C. R et al.IEE conference publication. 1999, pp 3.51.S7-3.54.S7, issn 0537-9989, isbn 0-85296-719-5Conference Paper
On the minimum distance of cyclic codesVAN LINT, J. H; WILSON, R. M.IEEE transactions on information theory. 1986, Vol 32, Num 1, pp 23-40, issn 0018-9448Article
Extremal self-dual codes from symmetric designsSPENCE, E; TONCHEV, V. D.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 265-268, issn 0012-365XArticle
On the existence of a certain (64,32,12) extremal codePLESS, V; TONCHEV, V; LEON, J et al.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 214-215, issn 0018-9448Article
An improved algorithm for evaluating trellis phase codesMULLIGAN, M. G; WILSON, S. G.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 846-851, issn 0018-9448Article
Optimum waveform signal sets with amplitude and energy constraintsWYNER, A. D; LANDAU, H. J.IEEE transactions on information theory. 1984, Vol 30, Num 4, pp 615-622, issn 0018-9448Article
Upper bounds on the minimum distance of trellis codesCALDERBANK, A. R; MAZO, J. E; SHAPIRO, H. M et al.The Bell System technical journal. 1983, Vol 62, Num 8, pp 2617-2646, issn 0005-8580Article
Chain of Separable Binary Goppa Codes and Their Minimal DistanceBEZZATEEV, Sergey; SHEKHUNOVA, Natalia.IEEE transactions on information theory. 2008, Vol 54, Num 12, pp 5773-5778, issn 0018-9448, 6 p.Article
Geometric conditions for the extendability of ternary linear codesMARUTA, Tatsuya; OKAMOTO, Kei.Lecture notes in computer science. 2006, pp 85-99, issn 0302-9743, isbn 3-540-35481-6, 1Vol, 15 p.Conference Paper
Interleavers for turbo codes that yield a minimum distance growing with blocklengthBOUTROS, Joseph; ZEMOR, Gilles.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 56Conference Paper
On the minimum distance of some families of Z2k-Linear codesGALAND, F.Lecture notes in computer science. 2003, pp 235-243, issn 0302-9743, isbn 3-540-40111-3, 9 p.Conference Paper
Asymptotic upper bounds on the minimum distance of trellis codesCALDERBANK, A. R; MAZO, J. E; WEI, V. K et al.IEEE transactions on communications. 1985, Vol 33, Num 4, pp 305-309, issn 0090-6778Article
Notes on the asymptotic behavior of the information rate of block codesAALTONEN, M. J.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 84-85, issn 0018-9448Article
Double circulant quadratic residue codesHELLESETH, Tor; VOLOCH, José Felipe.IEEE transactions on information theory. 2004, Vol 50, Num 9, pp 2154-2155, issn 0018-9448, 2 p.Article
Short-cycle-free interleaver design for increasing minimum squared euclidean distanceHOWARD, Sheryl L; ZEINODDIN, Siavash S; SCHLEGEL, Christian et al.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 54Conference Paper
Duadic codesSMID, M. H. M.IEEE transactions on information theory. 1987, Vol 33, Num 3, pp 432-433, issn 0018-9448Article
Minimum distance of logarithmic and fractional partial n-sequencesKUMAR, P. V; WEI, V. K.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1474-1482, issn 0018-9448Article
An optimal algorithm for computing the minimum vertex distance between two crossing convex polygonsTOUSSAINT, G. T.Computing (Wien. Print). 1984, Vol 32, Num 4, pp 357-364, issn 0010-485XArticle
New weight and runlength properties of insertion/deletion correcting codesCLARKE, W. A; FERREIRA, H. C.Africon conference in Africa. 2004, isbn 0-7803-8605-1, vol 1, 301-305Conference Paper
A determination of the parameters of a large class of Goppa codesJOHNSEN, T; MANSHADI, S; MONZAVI, N et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1678-1681, issn 0018-9448Article