Skip to search formSkip to main contentSkip to account menu

Online codes

Known as: Online code 
In computer science, online codes are an example of rateless erasure codes. These codes can encode a message into a number of symbols such that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
AlgorithmComputer scienceErasure codeFountain code

Broader (1)

Coding theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2020
Review
2020
Data analysis and machine learning tools in MATLAB and Python
2017
2017
LDSCD: A loss and DoS resistant secure code dissemination algorithm supporting multiple authorized tenants
2017
2017
Quality Hound — An online code smell analyzer for scratch programs
In this showpiece, we demonstrate the functionality of Quality Hound — an online program analysis tool that takes as input a… 
2015
2015
CODE GENERATION FOR SEMANTIC EVOLUTION OF EMBEDDED SYSTEMS
Monitoring and controlling a safety or a mission critical system (Production system) is normally undertaken through interfacing… 
2011
2011
Rateless codes for heterogeneous in-home interfaces aggregation
With the appearance of P2P networks and the rapid progress in the technologies used to setup in-home networks, these have… 
2007
2007
RMTool: Component-Based Network Management System for Wireless Sensor Networks
  • H. ChaInuk Jung
  • 4th IEEE Consumer Communications and Networking…
  • 2007
  • Corpus ID: 2334235
This paper introduces a component-based network management system for wireless sensor networks. The research is motivated by a… 
2005
2005
STUDENT CODE of CONDUCT in the ONLINE CLASSROOM: A CONSIDERATION of ZERO TOLERANCE POLICIES
The rapidly changing world of technology is creating unique challenges for today’s educators of higher learning. In particular, e… 
2004
2004
Analysis of a QBD process that depends on background QBD processes
We define a class of Markov chains that are called recursive foreground-background quasi-birth-and-death (RFBQBD) processes, and… 
2004
2004
The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially
We show that the number of ternary words of length n avoiding abelian cubes grows faster than r n , where r = 2 1=24 . 
2000
2000
Sams Teach Yourself Python in 24 Hours
From the Publisher: Sams Teach Yourself Python in 24 Hours presents 24 hands-on, one-hour lessons that guide you through all the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)