Results 221 to 230 of about 1,634 (262)
International Journal of Urban and Regional Research, EarlyView.Abstract Shrinking cities are increasingly drawing global attention, but urban shrinkage is seldom considered as an enduring structural condition necessitating a move beyond growth‐centric strategies. The focus often remains on mitigating symptoms rather than embracing the broader implications of long‐term decline. Understanding of what drives decision‐
Marjan Marjanović, Johanna Lilius
wiley +1 more source
Performance analysis of concatenated Reed-Solomon and next generation polar codes for 6G communication systems. [PDF]
Sci RepWondimu E, Annamalai P, Gared F.
europepmc +1 more source
Medical Imaging Data Calls for a Thoughtful and Collaborative Approach to Data Governance. [PDF]
PLOS Digit HealthLutz de Araujo A +6 more
europepmc +1 more source
Reflections of Indigenous, racialized, and Global South practitioners and scholars on liberatory community wellbeing and mental health praxis: A qualitative study. [PDF]
Am J Community PsycholBarhouche R.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2006 IEEE International Symposium on Information Theory, 2006
The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required
Chris Studholme, Ian Blake
openaire +1 more source
The design of erasure correcting codes and their decoding algorithms is now at the point where capacity achieving codes are available with decoding algorithms that have complexity that is linear in the number of information symbols. One aspect of these codes is that the overhead (number of coded symbols beyond the number of information symbols required
Chris Studholme, Ian Blake
openaire +1 more source
Erasure Decoding for Gabidulin Codes
Journal of Mathematical Modelling and Algorithms, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Babindamana, Regis F. +1 more
openaire +2 more sources
Erasure Coding for Decentralized Coded Caching
2018 IEEE International Symposium on Information Theory (ISIT), 2018Coded caching can significantly decrease the communication load in peak hours of the network. The gain of caching is maximized in a centralized setting, where the cache content of users are opportunistically designed. In the absence of a centralized placement, users' caches are filled with randomly selected packets of the files.
Hadi Reisizadeh +2 more
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
In this paper, we study binary pattern erasure codes, i.e., binary codes that are resiliant to erasures from a family P of possible erasures. We give an algorithmic proof of the existence of a binary linear code with codewords of length n that is resiliant to erasures from P when P satisfies the properties: every pattern p ϵ P has size m and every ...
Sheng Lin +4 more
openaire +1 more source
In this paper, we study binary pattern erasure codes, i.e., binary codes that are resiliant to erasures from a family P of possible erasures. We give an algorithmic proof of the existence of a binary linear code with codewords of length n that is resiliant to erasures from P when P satisfies the properties: every pattern p ϵ P has size m and every ...
Sheng Lin +4 more
openaire +1 more source
Cyclic repetition erasure code
2013 3rd International Conference on Consumer Electronics, Communications and Networks, 2013Distributed storage systems introduce redundancy to provide high data reliability, a simple strategy is replication, but it has a drawback of low storage efficiency, another popular strategy is using erasure code, but the repair cost and complexity are very high.
Meng-Fei Zhang, Shu-Tao Xia
openaire +1 more source
Verifying distributed erasure-coded data
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, 2007Erasure coding can reduce the space and band width overheads of redundancy in fault-tolerant data storage and delivery systems. But it introduces the fundamental difficulty of ensuring that all erasure-coded fragments correspond to the same block of data. Without such assurance, a different block may be reconstructed from different subsets of fragments.
James Hendricks +2 more
openaire +1 more source