Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...

Nested code pairs play a crucial role in the construction of ramp secret sharing schemes [16] and in the CSS construction of quantum codes [15]. The important parameters are (1) the codimension, (2) the relative minimum distance of the codes, and (3)...

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-pointalgebraic geometric codes defined from asymptotically good towers of function fields. Their securityis given by the relative generalized Hamming weights ...