Image de couverture de livre

Variant Codes Based on A Special Polynomial Ring and Their Fast Computations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yu, Leilei, Han, Yunghsiang S., Yuan, Jiasheng, Zhang, Zhongpei
Format:	Preprint
Publié:	2023
Sujets:	Information Theory Distributed, Parallel, and Cluster Computing Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

PoW Security-Latency under Random Delays and the Effect of Transaction Fees
par: Doger, Mustafa, et autres
Publié: (2024)

Transaction Capacity, Security and Latency in Blockchains
par: Doger, Mustafa, et autres
Publié: (2024)

Refined Bitcoin Security-Latency Under Network Delay
par: Doger, Mustafa, et autres
Publié: (2022)

Optimal Computation in Anonymous Dynamic Networks
par: Di Luna, Giuseppe A., et autres
Publié: (2022)

Efficient Computation in Congested Anonymous Dynamic Networks
par: Di Luna, Giuseppe A., et autres
Publié: (2023)

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
par: Gao, Chuanchao, et autres
Publié: (2025)

Algebraic Geometric Rook Codes for Coded Distributed Computing
par: Matthews, Gretchen L., et autres
Publié: (2024)

Learning-Based Approaches for Job Shop Scheduling Problems: A Review
par: Rihane, Karima, et autres
Publié: (2025)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
par: Doger, Mustafa, et autres
Publié: (2025)

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
par: Doger, Mustafa, et autres
Publié: (2024)

When Should Selfish Miners Double-Spend?
par: Doger, Mustafa, et autres
Publié: (2025)

Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
par: Elbek, Deniz, et autres
Publié: (2025)

Improved Distributed Algorithms for Random Colorings
par: Carlson, Charlie, et autres
Publié: (2023)

Jet: Multilevel Graph Partitioning on Graphics Processing Units
par: Gilbert, Michael S., et autres
Publié: (2023)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
par: Chalopin, Jérémie, et autres
Publié: (2026)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
par: Döring, Michelle
Publié: (2025)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
par: Li, Xiaorui, et autres
Publié: (2024)

SPHERE: Spherical partitioning for large-scale routing optimization
par: Lindermann, Robert Fabian, et autres
Publié: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
par: Bonamy, Marthe, et autres
Publié: (2025)

Lower bound for constant-size local certification
par: Martínez, Virgina Ardévol, et autres
Publié: (2022)

Convergence Sans Synchronization
par: Gupta, Arya Tanmay
Publié: (2025)

Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
par: Accorsi, Luca, et autres
Publié: (2025)

3-Majority and 2-Choices with Many Opinions
par: Shimizu, Nobutaka, et autres
Publié: (2025)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
par: Balbi, Pedro Paulo, et autres
Publié: (2026)

Efficient Approximation of Centrality Measures in Uncertain Graphs
par: Ketels, Daniel
Publié: (2024)

Asynchronous 3-Majority Dynamics with Many Opinions
par: Cooper, Colin, et autres
Publié: (2024)

A Parallel Hierarchical Approach for Community Detection on Large-scale Dynamic Networks
par: Bokov, Grigoriy, et autres
Publié: (2025)

Error Bounds for the Network Scale-Up Method
par: Díaz-Aranda, Sergio, et autres
Publié: (2024)

SUperman: Efficient Permanent Computation on GPUs
par: Elbek, Deniz, et autres
Publié: (2025)

Optimal Multilevel Slashing for Blockchains
par: Wood, Kenan, et autres
Publié: (2024)

Computing in Anonymous Dynamic Networks Is Linear
par: Di Luna, Giuseppe A., et autres
Publié: (2022)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
par: Fuchs, Marc, et autres
Publié: (2025)

Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments
par: Guo, Longkun, et autres
Publié: (2024)

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
par: Gao, Chuanchao, et autres
Publié: (2025)

Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
par: Cantaloube, Théo, et autres
Publié: (2026)

Causal Graph Dynamics and Kan Extensions
par: Maignan, Luidnel, et autres
Publié: (2024)

Network Centrality as a New Perspective on Microservice Architecture
par: Bakhtin, Alexander, et autres
Publié: (2025)

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs
par: Zhu, Hongyu, et autres
Publié: (2022)

Fast algorithms for Vizing's theorem on bounded degree graphs
par: Bernshteyn, Anton, et autres
Publié: (2023)

Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
par: Fuchs, Marc, et autres
Publié: (2024)