Run-Length-Limited (RLL) channels are found in digital recording systems like the Hard Disk Drive (HDD), Compact Disc (CD), and Digital Versatile Disc (DVD). This thesis presents novel encoding algorithms for RLL channels based on a simple technique called bit stuffing. First, two new capacity-achieving variable-rate code constructions are proposed for (d,k) constraints. The variable-rate encoding ideas are then extended to (0,G/I) and other RLL constraints. Since variable-rate codes are of limited practical value, the second half of this thesis focuses on fixed-rate codes. The fixed-rate bit stuff (FRB) algorithm is proposed for the design of simple, high-rate (0,k) codes. The key to achieving high encoding rates with the FRB algorithm lies in a novel, iterative pre-processing of the fixed-length input sequence prior to bit stuffing. Detailed rate analysis for the proposed FRB algorithm is presented, and upper and lower bounds on the asymptotic (in input block length) encoding rate are derived. Several system-level issues of the proposed FRB codes are addressed, and FRB code parameters required to design rate 100/101 and rate 200/201 (0,k) codes are tabulated. Finally, the proposed fixed-rate encoding is extended to (0,G/I) constraints.