Bounds on distance distributions in codes of known size

Artículos similares

The application of the branch and bound method in the problem of reconstructing the matrix of distances between DNA strings

Acceso

Boris Melnikov,Marina Trenina Pág. 1 - 13

In this paper, we continue to consider one of the tasks of biocybernetics, i.e. the problem of reconstructing the distance matrix between DNA sequences. In this problem, not all the elements of the matrix under consideration are known ... ver más

Revista: International Journal of Open Information Technologies

An extremum problem for polynomials and bounds for codes with given distance and diameter

Acceso

Fazekas, G. Pág. 789 - 795

Revista: MATHEMATICAL AND COMPUTER MODELLING

SPECIAL ISSUE ON CODES AND GRAPHS AND ITERATIVE ALGORITHMS - PAPERS - Minimum-Distance Bounds by Graph Analysis

Acceso

Tanner, R M Pág. 808 - 821

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

Concatenated Codes: Distance Properties and Performance Bounds - Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications

Acceso

Garello, R; Pierleoni, P; Benedetto, S Pág. 800 - 812

Revista: IEEE JOURNAL OF SELECTED AREAS IN COMMUNICATIONS

Concatenated Codes: Distance Properties and Performance Bounds - Woven Codes with Outer Warp: Variations, Design, and Distance Properties

Acceso

Freudenberger, J; Bossert, M; Zyablov, V V; Shavgulidze, S Pág. 813 - 824

Revista: IEEE JOURNAL OF SELECTED AREAS IN COMMUNICATIONS

Artículos similares

Revistas destacadas