Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric codes [4]-[8], [10]. In those works the focus is on full privacy and full reconstruction. In this paper we analyze additional parameters describing the asymptotic behavior of partial information leakage and possibly also partial reconstruction giving a more complete picture of the access structure for sequences of linear ramp secret sharing schemes. Our study involves a detailed treatment of the (relative) generalized Hamming weights of the considered codes.
This paper surveys development of quantum error correction. With the familiarity with conventional coding theory and tensor product in multi-linear algebra, this paper can be read in a self-contained manner.
We propose a Gilbert-Varshamov-type existential bound for the relative dimension length profile and the relative generalized Hamming weight of nested pairs of linear codes.