Welcome to my home[page].

Felicia:

my wonderful wife

Ari:

ME

Benni, Yoni and Manni:

my shayne punim

Work stuff...

I am an Associate Professor of Electrical and Computer Engineering at Boston University. An (old) brief biographical sketch is available in ps,or pdf for job-related purposes only.

Note to students: I do not submit recommendations using applyyourself.com because I do not agree with their Terms Of Service. If your school uses this service, you will need to request a paper version for any of my recommendations.

Courses taught

Affiliations

Selected publications

  • Rateless Coding with Feedback A. Hagedorn, D. Starobinski, and A. Trachtenberg
      INFOCOM 2009: pdf or ps.
  • Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes M. Laifenfeld , A. Trachtenberg , R. Cohen and D. Starobinski
  • Identifying Codes and Covering Problems M. Laifenfeld and A. Trachtenberg
    • IEEE Trans. Inf. Theory, September 2008: pdf.
  • Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks using Random Linear Codes A. Hagedorn, D. Starobinski, and A. Trachtenberg
    • IPSN 2008: pdf.
  • Closed-form expression for the parameters of binary lexicodes A. Trachtenberg
    • ITA 2008: pdf.
  • Adaptive rateless coding under partial information S. Agarwal, A. Hagedorn, and A. Trachtenberg
    • ITA 2008: pdf.
  • Near optimal update-broadcast of data sets S. Agarwal, A. Hagedorn, and A. Trachtenberg
  • Near optimal data dissemination policies for multi-channel, single radio wireless sensor networks D. Starobinski, W. Xiao, X. Qin, and A. Trachtenberg
  • Identifying codes and the set cover problem M. Laifenfeld, A. Trachtenberg, and T.Y. Berger-Wolf
  • Bandwidth Efficient String Reconciliation using Puzzles S. Agarwal, V. Chauhan, and A. Trachtenberg
    • IEEE Transactions on Parallel and Distributed Systems 2006: ps or pdf.
    • IEEE Globecom 2004 as "Reconciliation puzzles" by V. Chauhan and A. Trachtenberg: ps or pdf.
  • Fast data access over asymmetric channels using fair and secure bandwidth sharing S. Agarwal, M. Laifenfeld, A. Trachtenberg, and M. Alanyali
  • Approximating the number of differences between remote sets,
    S. Agarwal and A. Trachtenberg
    • IEEE Information Theory Workshop, Punta del Este, Uruguay, March 2006: ps or pdf.
  • Using bandwidth sharing to fairly overcome channel asymmetry S. Agarwal, M. Laifenfeld, A. Trachtenberg, and M. Alanyali
  • Disjoint identifying codes for arbitrary graphs M. Laifenfeld and A. Trachtenberg
  • Robust Location Detection with Sensor Networks S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi
  • An Implementation of Indoor Location Detection Systems Based on Identifying Codes R. Ungrangsi, A. Trachtenberg, and D. Starobinski
  • Full-rank tilings of F28 do not exist A. Trachtenberg and A. Vardy
    • SIAM Journal on Discrete Maths, 16:3, pp 390 - 392: ps or pdf.
  • Efficient PDA synchronization D. Starobinski, A. Trachtenberg, and S. Agarwal
  • Fast network synchronization S. K. Agarwal and A. Yaar and D. Starobinski and A. Trachtenberg
    • ACM SIGCOMM Comp. Comm. Review 32:3, July 2002, p. 14 (poster): pdf.
  • On the scalability of data synchronization protocols for PDAs and mobile devices S. Agarwal, D. Starboinski, and A. Trachtenberg
  • Fast PDA Synchronization Using Characteristic Polynomial Interpolation A. Trachtenberg, D. Starobinski, and S. Agarwal
  • Data verification and reconciliation with generalized error-control codes M. Karpovsky, L. Levitin, and A. Trachtenberg
  • Set Reconciliation with Nearly Optimal Communication Complexity Y. Minsky, A. Trachtenberg, and R. Zippel
  • Scalable set reconciliation Y. Minsky and A. Trachtenberg
    • Allerton, Oct. 2002: ps, or pdf.
    • Technical report BU ECE--2002-01, as Practical set reconciliation.
  • Space-time turn prohibitions for low density parity-check codes A. Trachtenberg and M. Karpovsky
  • Designing Lexicographic Codes with a Given Trellis Complexity A. Trachtenberg
    • IEEE Trans. Inf. Theory, January 2002: ps, pdf, or html.
    • CISS 1997: (under A. Trachtenberg and A. Vardy, Lexicographic Codes; Constructions, Bounds, and Trellis Complexities): ps or pdf.
  • Towards Global Synchronization A. Trachtenberg and D. Starobinski
  • Which Codes have Cycle-Free Tanner Graphs? T. Etzion, A. Trachtenberg, and A. Vardy
  • Error-Correcting Codes on Graphs: Lexicodes, Trellises, and Factor GraphsA. Trachtenberg
  • Computational Methods in Coding Theory A. Trachtenberg
    • Master's thesis: ps or pdf.

Programs et al.

EC330: (solutions to homework problems I have assigned)
  1. Tic Tac Toe: try to beat the computer on a 10x10 gridI
  2. Sudoku Solver: solves generalized Sudoku puzzles (as specified by the user).
Ban Solanum Lycopersicum:
a petition to ban this common restaurant product from the US food supply, as it can lead to hallucinations, coma, circulatory collapse, respiratory failure, and even death.
Reconciliation:
source code for our practical reconciliation engine. See also related pages for our memopad and string synchronizers, and our developing GenSync project.
Calculate code parameters (v2):
a web interface for calculating various parameters of error-correcting codes and computing lexicographic extensions. also available as an i686 or Sparc executables.
Car parking:
the winning implementations for a car parking problem I assigned in my SC504 class.
8D tilings:
Search for full-rank 8D tilings ( i686 executible is also available).
Bipartite graph GUI:
a Java command-based graphical user interface for drawing bipartite graphs
J-machine simulator:
SGI executable code for a three-dimensional simulator of J-machine packet routing (screenshot)
Code visualizer:
openGL-based 3D visualizer for algebraic codes (SGI executable -- screenshot)

About me...

Non-work stuff...

Formalities...