The following pages link to (Q4379555):
Displaying 50 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Generalized cyclotomic numbers of order two and their applications (Q301646) (← links)
- Whiteman's generalized cyclotomic numbers with respect to \(t\) primes (Q413567) (← links)
- Computationally efficient robust Chinese remainder theorem for frequency estimation from undersampled waveforms (Q473622) (← links)
- Applications of the Chinese remainder theorem to reaction systems with duration (Q496027) (← links)
- Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes (Q497226) (← links)
- The linear complexity of a class of binary sequences with period \(2p\) (Q499750) (← links)
- Graph state-based quantum secret sharing with the Chinese remainder theorem (Q517675) (← links)
- Two classes of optimal frequency-hopping sequences with new parameters (Q669616) (← links)
- Some arithmetical properties of cyclotomic cosets and their applications (Q776299) (← links)
- Lattice-based treshold-changeability for standard CRT secret-sharing schemes (Q998654) (← links)
- A trace representation of binary Jacobi sequences (Q1024461) (← links)
- Linear complexity of generalized cyclotomic binary sequences of order 2 (Q1266420) (← links)
- New generalized cyclotomy and its applications (Q1266994) (← links)
- Secret-sharing with a class of ternary codes (Q1583097) (← links)
- Combined random number generator via the generalized Chinese remainder theorem (Q1612315) (← links)
- The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields (Q1667457) (← links)
- Optimal FHSs and DSSs via near zero-difference balanced functions (Q1671375) (← links)
- Distributive weighted threshold secret sharing schemes (Q1671693) (← links)
- Primitive idempotents of irreducible cyclic codes of length \(n\) (Q1721319) (← links)
- A new family of optimal FHS sets with composite lengths (Q1732779) (← links)
- On quantum secret sharing via chinese remainder theorem with the non-maximally entanglement state analysis (Q1945398) (← links)
- High-efficient quantum secret sharing based on the Chinese remainder theorem via the orbital angular momentum entanglement analysis (Q1952619) (← links)
- Scalable antinoise-robustness estimation of frequency and direction of arrival based on the relaxed sparse array (Q2002402) (← links)
- Two new classes of binary sequence pairs with three-level cross-correlation (Q2018433) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- Autocorrelation and linear complexity of binary generalized cyclotomic sequences with period \(pq\) (Q2036028) (← links)
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients (Q2040358) (← links)
- Algorithm for constructing modular projections for correcting multiple errors based on a redundant residue number system using maximum likelihood decoding (Q2064397) (← links)
- Formalization of ring theory in PVS. Isomorphism theorems, principal, prime and maximal ideals, Chinese remainder theorem (Q2069874) (← links)
- A new \((w, t, n)\)-weighted threshold quantum secret sharing scheme based on two-qubit system (Q2096804) (← links)
- Fuzzy congruences on AG-group (Q2131574) (← links)
- Faster homomorphic encryption over GPGPUs via hierarchical DGT (Q2147259) (← links)
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity (Q2173738) (← links)
- On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme (Q2198255) (← links)
- A new threshold changeable secret sharing scheme based on the Chinese remainder theorem (Q2200703) (← links)
- Zero-difference balanced functions with applications (Q2322058) (← links)
- Minimal reaction systems: duration and blips (Q2358692) (← links)
- Threshold cryptography based on Asmuth-Bloom secret sharing (Q2384533) (← links)
- Discrete logarithm and minimum circuit size (Q2404611) (← links)
- On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials (Q2414937) (← links)
- A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme (Q2446574) (← links)
- General Secret Sharing Based on the Chinese Remainder Theorem with Applications in E-Voting (Q2866729) (← links)
- 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)
