The following pages link to (Q4379555):
Displaying 15 items.
- An asymptotically perfect secret sharing scheme based on the Chinese Remainder Theorem (Q3174872) (← links)
- Generalized cyclotomic numbers with respect to prime powers (Q3177707) (← links)
- Robust Threshold Schemes Based on the Chinese Remainder Theorem (Q3506373) (← links)
- Generalizing Ruth-Aaron Numbers (Q4987380) (← links)
- An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code (Q4987560) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- Cyclic codes with generalized cyclotomic cubic classes (Q5036730) (← links)
- (Q5212443) (← links)
- Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence (Q5357509) (← links)
- Simplification on dynamic range of a generalized Chinese remainder theorem for multiple integers (Q5384162) (← links)
- Simplified Bounds on FHSs Set and Its Strictly Optimal Construction (Q5859629) (← links)
- Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings (Q5919349) (← links)
- A perfect secret sharing scheme for general access structures (Q6118655) (← links)
- Type-II polyadic constacyclic codes over finite fields (Q6174154) (← links)
- MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\) (Q6542650) (← links)
