String Searching in Dispersed Files using MDS Convolutional Codes
نویسندگان
چکیده
In this paper, we propose use of convolutional codes for file dispersal. The proposed method is comparable in complexity to the information Dispersal Algorithm proposed by M.Rabin and for particular choices of (non-binary) convolutional codes, is almost as efficient as that algorithm in terms of controlling expansion in the total storage. Further, our proposed dispersal method allows string
منابع مشابه
Constructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملConstructions of MDS-convolutional codes - Information Theory, IEEE Transactions on
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized Singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate and each degree . The c...
متن کاملConstruction of Unit-Memory MDS Convolutional Codes
Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over Fq with flexible parameters. Compared with previous works, the field size q required to ...
متن کاملConstruction Results for MDS - Convolutional Codes '
The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.
متن کاملConstruction results for MDS-convolutional codes - International Symposium on Information Theory, 2000. Proceedings. IEEE
The generalized Singleton bound and MDS-convolutional codes are reviewed. For each n, k and 6 an elementary construction of rate k / n MDS convolutional codes of degree 6 is given.
متن کامل